Submission #1023905
Source Code Expand
# -*- coding: utf-8 -*-
def findSnuke():
H, W = map(int, input().split())
alphabet = "ABCDEFGHIJKLMNOPQRSTU"
for i in range(H):
row = input().split()
for j in range(W):
if row[j] == "snuke":
return alphabet[i] + str(j+1)
print(findSnuke())
Submission Info
| Submission Time | |
|---|---|
| Task | A - Where's Snuke? |
| User | St_Hakky |
| Language | Python (3.4.3) |
| Score | 0 |
| Code Size | 310 Byte |
| Status | WA |
| Exec Time | 23 ms |
| Memory | 3064 KB |
Judge Result
| Set Name | sample | all | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 0 / 100 | ||||||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| sample | sample-01.txt, sample-02.txt |
| all | sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| 01-01.txt | AC | 23 ms | 3064 KB |
| 01-02.txt | AC | 23 ms | 3064 KB |
| 01-03.txt | WA | 23 ms | 3064 KB |
| 01-04.txt | WA | 23 ms | 3064 KB |
| 01-05.txt | WA | 23 ms | 3064 KB |
| 01-06.txt | WA | 23 ms | 3064 KB |
| 01-07.txt | WA | 22 ms | 3064 KB |
| sample-01.txt | WA | 23 ms | 3064 KB |
| sample-02.txt | AC | 23 ms | 3064 KB |