Submission #2362929
Source Code Expand
N, M = list(map(int,input().split())) a = [] for i in range(N): a.append(list(input().split())) b = 0 c = 0 d = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' for i in range(N): for j in range(M): if a[i][j] == 'snuke': b = i+1 c = j print(d[c]+str(b))
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | toku |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 290 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 3064 KB |
Judge Result
Set Name | sample | all | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 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, sample-01.txt, sample-02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 17 ms | 3060 KB |
01-02.txt | AC | 18 ms | 3060 KB |
01-03.txt | AC | 17 ms | 3064 KB |
01-04.txt | AC | 17 ms | 3060 KB |
01-05.txt | AC | 18 ms | 3064 KB |
01-06.txt | AC | 17 ms | 3060 KB |
01-07.txt | AC | 17 ms | 3060 KB |
sample-01.txt | AC | 18 ms | 3060 KB |
sample-02.txt | AC | 17 ms | 2940 KB |