Submission #4736032


Source Code Expand

H,W=map(int,input().split())
l=['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']
a=b=''
for i in range(H):
  l2=list(map(str,input().split()))
  for j in range(W):
    if l2[j]=='snuke':
      a=l[j]
      b=str(i+1)
print(a+b)

Submission Info

Submission Time
Task A - Where's Snuke?
User Kenkoro
Language Python (3.4.3)
Score 100
Code Size 292 Byte
Status AC
Exec Time 18 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 18 ms 3064 KB
01-02.txt AC 17 ms 3064 KB
01-03.txt AC 18 ms 3064 KB
01-04.txt AC 18 ms 3064 KB
01-05.txt AC 18 ms 3064 KB
01-06.txt AC 18 ms 3064 KB
01-07.txt AC 18 ms 3064 KB
sample-01.txt AC 18 ms 3064 KB
sample-02.txt AC 18 ms 3064 KB