Submission #1023900


Source Code Expand

# -*- coding: utf-8 -*-

def findSnuke(H, W):
    for i in range(H):
        row = input().split()
        for j in range(W):
            if row[j] == "snuke":
                return [i, j]


H, W = map(int, input().split())

alphabet = "ABCDEFGHIJKLMNOPQRSTU"
col, row = findSnuke(H, W)

print(alphabet[row] + str(col+1))

Submission Info

Submission Time
Task A - Where's Snuke?
User St_Hakky
Language Python (3.4.3)
Score 0
Code Size 339 Byte
Status RE
Exec Time 22 ms
Memory 3064 KB

Judge Result

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