Submission #6797059


Source Code Expand

H,W = map(int,input().split())
S =[list(input().split()) for i in range(H)]
c_dict = {0:"1",1:"2",2:"3",3:"4",4:"5",5:"6",6:"7",7:"8",8:"9",9:"10",10:"11",\
11:"12",12:"13",13:"14",14:"15",15:"16",16:"17",17:"18",18:"A",19:"B",20:"C",\
21:"D",22:"E",23:"F",24:"G",25:"H"}

l_dict = {0:"A",1:"B",2:"C",3:"D",4:"E",5:"F",6:"G",7:"H",8:"I",9:"J",10:"K",\
11:"L",12:"M",13:"N",14:"O",15:"P",16:"Q",17:"R",18:"S",19:"T",20:"U",21:"V",\
22:"W",23:"X",24:"Y",25:"Z"}

for i in range(H):
    for j in range(W):
        if S[i][j]=="snuke":
            print(l_dict[j]+c_dict[i])
            exit()

Submission Info

Submission Time
Task A - Where's Snuke?
User SleepyPuppy
Language Python (3.4.3)
Score 100
Code Size 603 Byte
Status AC
Exec Time 17 ms
Memory 3064 KB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 11
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 3064 KB
01-02.txt AC 17 ms 3064 KB
01-03.txt AC 17 ms 3064 KB
01-04.txt AC 17 ms 3064 KB
01-05.txt AC 17 ms 3064 KB
01-06.txt AC 17 ms 3064 KB
01-07.txt AC 17 ms 3064 KB
sample-01.txt AC 17 ms 3064 KB
sample-02.txt AC 17 ms 3064 KB