Problem:


Score : 100 points

Problem Statement

There is a grid with H rows and W columns.

The square at the i-th row and j-th column contains a string S_{i,j} of length 5.

The rows are labeled with the numbers from 1 through H, and the columns are labeled with the uppercase English letters from A through the W-th letter of the alphabet.

Exactly one of the squares in the grid contains the string snuke. Find this square and report its location.

For example, the square at the 6-th row and 8-th column should be reported as H6.

Constraints

1≦H, W≦26

The length of S_{i,j} is 5.

S_{i,j} consists of lowercase English letters (a-z).

Exactly one of the given strings is equal to snuke.

Input

The input is given from Standard Input in the following format:

H W
S_{1,1} S_{1,2} ... S_{1,W}
S_{2,1} S_{2,2} ... S_{2,W}
:
S_{H,1} S_{H,2} ... S_{H,W}

Output

Print the labels of the row and the column of the square containing the string snuke, with no space inbetween.

Sample Input 1

15 10
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snuke snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake

Sample Output 1

H6

Sample Input 2

1 1
snuke

Sample Output 2

A1



Sample input:
15 10
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snuke snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake
snake snake snake snake snake snake snake snake snake snake


Sample output:
H6

Submission status: Accepted

Solution code:
def examA():
    H, W = LI()
    S = [LSI() for _ in range(H)]
    Alpha = [chr(ord('A') + i) for i in range(26)]
    for i in range(H):
        for j in range(W):
            if S[i][j]=="snuke":
                ans = str(Alpha[j]) + str(i+1)
    print(ans)
    return


import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

if __name__ == '__main__':
    examA()

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
for i in range(H):
    S = input().split()
    for j in range(W):
        if S[j] == "snuke":
            print(chr(65+j) + str(i+1))

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
H=a[0]
W=a[1]
S = [input().split() for l in range(H)]

for i in range(H):
    if 'snuke' in S[i]:
        raw=i+1
        try:
            column=S[i].index('snuke')+1
            num2alpha = lambda c: chr(c+64)
            column=num2alpha(column)
        except:
            continue

print(column+str(raw))

Submission status: Accepted

Solution code:
# 2019/12/20

h,w=map(int,input().split())
snuke=[list(input().split()) for _ in range(h)]

for i in range(h):
    for j in range(w):
        if snuke[i][j]!='snuke':continue
        print(chr(j+65)+str(i+1))
        exit()

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
S = [input().split() for _ in range(H)]

for i in range(H) :
  for j in range(W) :
    if S[i][j] == 'snuke' :
      print(chr(ord('A') + j) + str(i + 1))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
for i in range(h):
  s=input().split()
  if "snuke" in s:
    j=s.index("snuke")
    ans=[chr(ord("A")+j), i+1]
    break

print(*ans,sep="")

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
for i in range(1,h+1):
  l=input().split()
  for j in range(w):
    if l[j]=="snuke":
      print(chr(65+j)+str(i))

Submission status: Accepted

Solution code:
h,w = map(int, input().split())

s = [list(map(str,input().split())) for i in range(h)]

alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

answer = ""
for i in range(h):
  for j in range(w):
    if s[i][j] == "snuke":
      answer = alphabet[j] + str(i+1)

print(answer)

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
for i in range(h):
  a=list(input().split())
  for j in range(w):
    if a[j]=='snuke':
      x=str(i+1)
      print(chr(ord('A')+j)+x)

Submission status: Accepted

Solution code:
import sys
import numpy as np
from string import ascii_uppercase as alphabet

def main():
    H, W = map(int, sys.stdin.readline().split())
    table = np.array(sys.stdin.read().split(), dtype='U5').reshape(H, W)

    for i in range(H):
        for j in range(W):
            if table[i][j] == 'snuke':
                ans = alphabet[j] + str(i+1)
                print(ans)
                sys.exit()
                
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
key = "snuke"

for i in range(H):
    S = input().split()
    if key in S:
        index = S.index(key)
        print(chr(65 + index) + str(i + 1)) #ASCIIコードでAは65

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
state = [list(map(str, input().split())) for _ in range(H)]

A = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for h in range(H):
  for w in range(W):
    if state[h][w] == 'snuke':
      ans = A[w] + str(h+1)
print(ans)

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
S = [input().split() for i in range(H)]
for i in range(W):
    for j in range(H):
        if S[j][i] == "snuke":
            print("{}".format(chr(65 + i)) + "{}".format(j+1))
            exit(0)

Submission status: Accepted

Solution code:
#coding:utf-8
h, w = map(int, input().split())
s = [list(map(str, input().split())) for _ in range(h)]

for i in range(h):
    for j in range(w):
        if s[i][j] == 'snuke':
            print(chr(ord('A')+j) + str(i+1))
            break

Submission status: Accepted

Solution code:
H,W=map(int,input().split())
S=[]
for i in range(H):
    S.append(input().split())
for i in range(H):
    for j in range(W):
        if S[i][j]=='snuke':
            print(chr(ord('A')+j)+str(i+1))

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read

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

for i, s in enumerate(S):
    if s == 'snuke':
        print(chr(65 + i % W) + str(i // W + 1))

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read

H, W, *S = read().split()
H, W = int(H), int(W)
ABC = [chr(i) for i in range(65, 65 + 26)]

for i, s in enumerate(S):
    if s == 'snuke':
        print(ABC[i % W] + str(i // W + 1))

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read

H, W, *S = read().split()
H, W = int(H), int(W)
ABC = [chr(i) for i in range(65, 65 + 26)]

for i in range(H * W):
    if S[i] == 'snuke':
        print(ABC[i % W] + str(i // W + 1))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import string
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(H: int, W: int, S: "List[List[str]]"):
    for i in range(H):
        for j in range(W):
            if S[i][j] == 'snuke':
                print(''.join(map(str, [string.ascii_uppercase[j], i+1])))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    H = int(next(tokens))  # type: int
    W = int(next(tokens))  # type: int
    S = [[next(tokens) for _ in range(W)] for _ in range(H)]  # type: "List[List[str]]"
    solve(H, W, S)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import string

H, W = map(int, input().split())
S = [input().split() for _ in range(H)]

for i in range(H):
    for j in range(W):
        if S[i][j] == "snuke":
            print(string.ascii_uppercase[j] + str(i + 1))
            exit()

Submission status: Accepted

Solution code:
H, W = map(int,input().split())
for i in range(H):
  A = input().split()
  for j in range(len(A)):
    if A[j] == 'snuke':
      ans = chr(ord('A')+j) + str(i+1)
      print(ans)

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
S = [list(input().split()) for _ in range(H)]

alp ="ABCDEFGHIJKLMNOPQRSTUVWXYZ"

for ite, line in enumerate(S):
  for itr, val in enumerate(line):
    if val == "snuke":
      print(alp[itr]+str(ite+1))
      exit()

Submission status: Accepted

Solution code:
import sys
H,W = map(int,input().split())
alp = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
S = []

for i in range(H):
    s = list(input().split())
    S.append(s)

for i in range(H):

    for j in range(W):

        if S[i][j] == "snuke":
            print (alp[j]+str(i+1))
            sys.exit()

Submission status: Accepted

Solution code:
import string
H, W = map(int, input().split())
ans = ''

for h in range(1, H + 1):
    line = input().split()
    for w, s in zip(string.ascii_uppercase[:W], line):
        if s == 'snuke':
            ans = '{}{}'.format(w, h)

print(ans)

Submission status: Accepted

Solution code:
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"]
h, w = map(int, input().split())
for i in range(h):
  s = list(map(str, input().split()))
  if "snuke" in s:
    print(l[s.index("snuke")] + str(i+1))
    break

Submission status: Accepted

Solution code:
H,W=map(int,input().split())
line=1
for i in range(H):
  s=list(input().split())
  if "snuke" in s:
    print(chr(s.index("snuke")+65) + str(line))
    break
  else:
    line+=1

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
board = [input().split() for _ in range(h)]
a = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"

for i in range(h):
    for j in range(w):
        if board[i][j] == "snuke":
            print(a[j]+str(i+1))

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
a = [""]*h
for i in range(h):
  a[i] = input().split()

for i in range(h):
  for j in range(w):
    if a[i][j] == "snuke":
      print("{}{}".format(chr(65+j), str(i+1)))
      exit()

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
S=[]
ans=0
ans1=0
W=['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']
for i in range(h):
  S.append(input().split())
for k in range(h):
  for j in range(w):
    if S[k][j]=='snuke':
      ans=j
      ans1=str(k+1)
print(W[ans]+ans1)

Submission status: Accepted

Solution code:
h, w = map(int, input().split())

num2alpha = lambda c: chr(c+64)

for i in range(h):
  l = list(map(str, input().split()))
  for j in range(w):
    if l[j] == 'snuke':
      y = i+1
      x = num2alpha(j+1)
      print(str(x)+str(y))
      exit()

Submission status: Accepted

Solution code:
H,W=map(int,input().split())
S=[list(map(str,input().split())) for i in range(H)]
for i in range(H):
    for j in range(W):
        if S[i][j]=="snuke":
            tmp=chr(j+65)
            print(tmp+str(i+1))
            exit()

Submission status: Accepted

Solution code:
H,W=map(int,input().split())
for i in range(H):
  S=list(map(str,input().split()))
  for j in range(W):
    if(S[j]=="snuke"):
      print(chr(j+ord('A')),end="")
      print(i+1)
      break

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
S=[list(map(str,input().split())) for _ in range(h)]

alpha=[chr(ord('A') + i) for i in range(26)]
for i in range(h):
  for j in range(w):
    if S[i][j]=='snuke':
      print(alpha[j]+str(i+1))
      exit()

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
S = [list(input().split()) for i in range(h)]

a = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'

for i in range(h):
    for j in range(w):
        if S[i][j] == 'snuke':
            print(a[j]+str(i+1))
            break

Submission status: Accepted

Solution code:
h, w = map(int, input().split())

answer = list()

for i in range(h):
    r = list(input().split())
    if "snuke" in r:
        answer = [chr(r.index("snuke") + 65), str(i + 1)]
print("".join(answer))

Submission status: Accepted

Solution code:
H, W = tuple(map(int, input().split()))
for h in range(H):
    row = input().split()
    for i, s in enumerate(row):
        if s == "snuke":
            print(chr(ord("A") + i) + str(h+1))
            exit()

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    d = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
    h, w = list(map(int, input().rstrip('\n').split()))
    for i in range(h):
        s = list(map(str, input().rstrip('\n').split()))
        for j in range(w):
            if s[j] == "snuke":
                print(d[j] + str(i+1))
                exit()


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
#list(map(int, input().split()))
h, w = map(int, input().split())
s = [list(input().split()) for _ in range(h)]
alph='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
for i in range(h):
    for j in range(w):
        if s[i][j] == 'snuke':
            print(alph[j]+str(i+1))
            break

Submission status: Accepted

Solution code:
#%%

num2alpha = lambda c: chr(c+64)

h, w = map(int, input().split())
s = [[] for _ in range(h)]
for i in range(h):
     s[i] = list(input().split())
     for j in range(w):
        if s[i][j] == 'snuke':
            a = i + 1
            b = num2alpha(j + 1)

print(str(b)+str(a))








#%%

Submission status: Accepted

Solution code:
h,w=map(int,input().split())


for i in range(h):
    s=list(map(str,input().split()))
    if 'snuke' in s:
        su=i+1
        break
a=s.index('snuke')
al=list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')
print(al[a]+str(su))

Submission status: Accepted

Solution code:
abc = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
H, W = map(int, input().split())
S = [[] for i in range(H)]
for i in range(H):
    S[i] = list(input().split())
    
for i in range(H):
    for j in range(W):
        if S[i][j] == "snuke":
            print(abc[j] + str(i + 1))
            break

Submission status: Accepted

Solution code:
# cf16-finalA - Where's Snuke?
from string import ascii_uppercase


def main():
    H, W, *S = open(0).read().split()
    H, W, abc = int(H), int(W), ascii_uppercase
    for i, s in enumerate(S):
        if s == "snuke":
            print(abc[i % W], i // W + 1, sep="")
            return


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def resolve():
    h, w = map(int, input().split())
    s = list(list(input().split()) for _ in range(h))
    for i, line in enumerate(s):
        if "snuke" in line:
            print("{}{}".format(chr(line.index("snuke") + 97).upper(), str(i + 1)))
            return 1


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
for j in range(h):
    a=list(map(str,input().split()))
    for i in range(w):
        if a[i]=='snuke':
            c='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
            print(c[i]+str(j+1))
            break
    else:
        continue
    break

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
s = [list(input().split()) for i in range(h)]
li = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for i in range(h):
    for j in range(w):
        if s[i][j] == "snuke":
            print(li[j]+str(i+1))

Submission status: Accepted

Solution code:
H,W=map(int,input().split())
S=[list(input().split()) for _ in range(H)]

for i,s in enumerate(S):
  #print(s)
  if "snuke" in s:
    j=s.index("snuke")
    break
print(chr(j+65)+str(i+1))

Submission status: Accepted

Solution code:
def solve(h, w, s):
    p = [chr(ord("A") + i) for i in range(26)]
    for r in range(h):
        for c in range(w):
            if s[r][c] == "snuke":
                return "%s%s" % (p[c], r+1)

h, w = map(int, input().split())
s = [input().split() for r in range(h)]
print(solve(h, w, s))

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
for i in range(H):
  Ss = input().split()
  for j in range(W):
    if Ss[j] == "snuke":
      r = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"[j]+str(i+1)
      print(r)
      exit()

Submission status: Accepted

Solution code:
H,W = map(int,input().split())
snuke_list_list = []
snuke_list = []
for i in range(H) : 
    snuke_list_list.append(input().split())

for i in range(H) :
    # snuke_list = [str(i) for i in input().split()]
    snuke_list = snuke_list_list[i]

    if ("snuke" in snuke_list) :
        index = snuke_list.index("snuke")
        c = chr(ord("A") + index)
        print(c + str(i+1))
        break

Submission status: Accepted

Solution code:
h,w=list(map(int,input().split()))
s=[input().split() for i in range(h)]
for i in range(w):
  for j in range(h):
    if(s[j][i]=="snuke"):
      print(str(chr(i+65))+str(j+1))

Submission status: Accepted

Solution code:
H,W=map(int,input().split())

for i in range(H):
    s=list(input().split())
    for j in range(W):
        if s[j]=="snuke":
            print(chr(ord("A")+j)+str(i+1))

Submission status: Accepted

Solution code:
from numpy import*;H,_=input().split();i,j=where(array([input().split()for _ in range(int(H))])=="snuke");print(chr(*j+65)+str(*i+1))

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
al = [chr(i) for i in range(65,65+26)]
for i in range(H):
  S = list(input().split())
  for j in range(W):
    if S[j] == "snuke":
      print(al[j]+str(i+1))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
labt=[chr(i) for i in range(65, 65+26)]
for i in range(h):
    l=list(input().split())
    try:
        print(labt[l.index("snuke")]+str(i+1))
    except:continue

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
k=[]
for i in range(h):
	a=list(input().split())
	k.append(a)
for i in range(h):
	for j in range(w):
		if k[i][j]=="snuke":
			print(chr(65+j)+str(i+1))
			break

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
s = [list(input().split()) for _ in range(h)]

for i in range(h):
    for j in range(w):
        if s[i][j] == 'snuke':
            print('{}{}'.format(chr(j + 65), i+1))
            break

Submission status: Accepted

Solution code:
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 status: Accepted

Solution code:
H, W = [int(_) for _ in input().split()]
S = [input() for _ in range(H)]

for h, Sh in enumerate(S):
    if Sh.find("snuke") != -1:
        w = Sh.split().index("snuke")
        print(chr(ord('A') + w) + str(h + 1))

Submission status: Accepted

Solution code:
H,W=map(int,input().split())
li=[input().split() for _ in range(H)]
a=["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"]
for i in range(H):
  if "snuke" in li[i]:
    break
j=li[i].index("snuke")
print(a[j]+str(i+1))

Submission status: Accepted

Solution code:
H, W = [int(i) for i in input().split()]
S = [input().split() for _ in range(H)]

for h in range(H):
    for w in range(W):
        if S[h][w] == "snuke":
            print(chr(ord("A") + w) + str(h + 1))
            break

Submission status: Accepted

Solution code:
H, W = map(int,input().split())
S = []
for i in range(H):
    S.append(input().split())
for h in range(H):
    for w in range(W):
        if S[h][w] == 'snuke':
            print(chr(ord('A')+w)+str(h+1))

Submission status: Accepted

Solution code:
H, W  = map(int,input().split())
S = [list(map(str,input().split())) for i in range(H)]
char = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for i in range(H):
    for j in range(W):
        if S[i][j] == "snuke":
            tmp = [i,j]
ans = str(char[tmp[1]]) + str(tmp[0]+1)
print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
alphabet = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ans = 'snake'
h, w = map(int, input().split())

for i in range(h):
  i += 1
  s = [x for x in input().split()]
  if 'snuke' in s:
    ans = alphabet[s.index('snuke')] + str(i)
    break

print(ans)

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
G = [input().split() for _ in range(H)]

for y in range(H):
	for x in range(W):
		if G[y][x] == "snuke":
			print(chr(ord("A") + x) + str(y + 1))
			exit()

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
G = [input().split() for _ in range(H)]

for y in range(H):
	for x in range(W):
		if G[y][x] == "snuke":
			print("ABCDEFGHIJKLMNOPQRSTUVWXYZ"[x] + "{:d}".format(y + 1))
			exit()

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
s = [list(input().split()) for _ in range(h)]

for i in range(h):
    for j in range(w):
        if s[i][j] == 'snuke':
            num = i + 1
            alpha = j + 1
            break

num2alpha = lambda c: chr(c+64)

print(str(num2alpha(alpha)) + str(num))

Submission status: Accepted

Solution code:
# cf16-finalA - Where's Snuke?
from string import ascii_uppercase


def main():
    h, w = list(map(int, input().rstrip().split()))
    A = [input().rstrip().split() for _ in range(h)]
    S = ascii_uppercase
    for i in range(h):
        for j in range(w):
            if A[i][j] == "snuke":
                print(S[j], i + 1, sep="")
                return


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
h, w = [ int(v) for v in input().split() ]
field =  [ input().split() for i in range(h) ]
for i in range(h):
    for j in range(w):
        if field[i][j] == "snuke":
            print(chr(j+65)+str(i+1))

Submission status: Accepted

Solution code:
h, w = [int(i) for i in input().split()]
key = "snuke"
for i in range(h):
    s = input().split()
    if key in s:
        idx = s.index(key)
        print(chr(idx+65)+str(i+1))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
snuke=[]
for i in range(h):
  snuke.append(list(map(str,input().split())))
for i in range(h):
  for j in range(w):
    if snuke[i][j]=="snuke":
      print(chr(97+j).upper()+str(i+1))

Submission status: Accepted

Solution code:
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys
import string

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

H, W = list(map(int, sys.stdin.readline().split()))
S = np.array([sys.stdin.readline().rstrip().split() for _ in range(H)])
[h], [w] = np.where(S == 'snuke')

print(string.ascii_uppercase[w] + str(h + 1))

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
for i in range(h):
  S=[s for s in input().split()]
  for j in range(w):
    if S[j]=="snuke":
      t=chr(ord('A')+j)
      print(t,i+1,sep="")
      break

Submission status: Accepted

Solution code:
H,W = map(int,input().split())
for i in range(H):
    S = input().split()
    if "snuke" in S:
        gyou = S.index("snuke")
        retsu = i + 1
gyou = chr(gyou+65)
print(gyou+str(retsu))

Submission status: Accepted

Solution code:
###template###
import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())
###template###

H, W = mi()
S = []
for _ in range(H):
  S.append(input().split())


sni = 0 #タテ
snj = 0 #ヨコ
for i, s in enumerate(S):
  for j, word in enumerate(s):
    if word == 'snuke':
      sni = i + 1
      snj = j

print(chr(ord('A')+snj)+str(sni))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - Where's Snuke?
https://atcoder.jp/contests/cf16-final/tasks/codefestival_2016_final_a

"""
import sys


from string import ascii_uppercase

def solve(grid):
    for y, row in enumerate(grid, start=1):
        for x, word in enumerate(row):
            if word == 'snuke':
                return ascii_uppercase[x] + str(y)


def main(args):
    H, W = map(int, input().split())
    grid = [input().split() for _ in range(H)]
    ans = solve(grid)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
alph = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
a, b = map(int, input().split())
for i in range(a):
  c= input().split()
  for j in range(b):
    if c[j] == "snuke":
      print(alph[j] + str(i + 1))
      exit()

Submission status: Accepted

Solution code:
h, w = map(int, input().split())
for i in range(h):
  row = input().split()
  for j in range(w):
    if row[j] == 'snuke':
      print('ABCDEFGHIJKLMNOPQRSTUVWXYZ'[j]+str(i+1))
      exit()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys

def input(): return sys.stdin.readline().strip()
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

H,W=MAP()
grid=[None]*H
for i in range(H):
    grid[i]=input().split()
for i in range(H):
    for j in range(W):
        if grid[i][j]=='snuke':
            print(chr(j+65)+str(i+1))
            exit()

Submission status: Accepted

Solution code:
h,w=map(int,input().split())
disp=['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']
for i in range(h):
  arr=list(map(str,input().split()))
  for j in range(w):
    if arr[j]=='snuke':
      print(disp[j]+str(i+1))

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
retsulist = [chr(i) for i in range(65, 65+26)]
for i in range(H):
    S = input().split()
    for j in range(W):
        if S[j] == 'snuke':
            print(retsulist[j] + str(i + 1))

Submission status: Accepted

Solution code:
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 status: Accepted

Solution code:
H,W = map(int,input().split())
alp = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
k = ''
for i in range(H):
    s = list(input().split())
    if s.count('snuke')>0:
        k = alp[s.index('snuke')]+str(i+1)
print(k)

Submission status: Accepted

Solution code:
#coding: utf-8
H, W = map(int, input().split())
table = []
for _ in range(H):
    table.append(list(input().split()))
alp = [chr(i) for i in range(65, 65+26)]
for i in range(H):
    for j in range(W):
        if table[i][j] == "snuke":
            print(alp[j] + str(i+1))
            break

Submission status: Accepted

Solution code:
#CF16A
A=[chr(ord('A') + i) for i in range(26)]
H,W=map(int,input().split())
S=[list(map(str,input().split())) for _ in range(H)]
for h in range(H):
    for w in range(W):
        if S[h][w]=='snuke':
            print(A[w]+str(h+1))

Submission status: Accepted

Solution code:
H, W = map(int, input().split())
S = [list(map(str, input().split())) for _ in range(H)]

for i in range(H):
    for j in range(W):
        if S[i][j] == 'snuke':
            res1 = i + 1
            res2 = j
            break
            
print(chr(ord('A') + res2) + str(res1))

Submission status: Accepted

Solution code:
_,w,*a=open(0).read().split();w=int(w);i=a.index('snuke');print(chr(i%w+65)+str(i//w+1))

Submission status: Accepted

Solution code:
H,W = map(int,input().split())
L = []
A = ['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']
for i in range(H):
  L.append(input().split())
for i in range(H):
  for j in range(W):
    if L[i][j] == 'snuke':
      k = i+1
      l = A[j]
      break
print(l+str(k))

Submission status: Accepted

Solution code:
h,w = map(int,input().split())
maps = []
alphabet = ["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"]
for i in range(h):
    maps.append(list(map(str,input().split())))
for i in range(h):
    for j in range(w):
        if maps[i][j] == "snuke":
            print(alphabet[j]+str(i+1))
            exit()

Submission status: Accepted

Solution code:
H, W = [int(i) for i in input().split()]
S = [[i for i in input().split()] for j in range(H)]

for h in range(H):
    for w in range(W):
        if S[h][w] == 'snuke':
            print(chr(ord('A') + w) + str(h + 1))
            exit()

Submission status: Accepted

Solution code:
#N = int(input())
H,W = [int(i) for i in input().split()]
s = [[j for j in input().split()] for i in range(H)]

for h in range(H):
    for w in range(W):
        if s[h][w] == "snuke":
            row = chr(ord('A')+w)
            print(row+str(h+1))

Submission status: Accepted

Solution code:
h,w = map(int,input().split())
for i in range(h):
    l = input().split()
    for j in range(w):
        if l[j] == 'snuke':
            print(chr(ord('A')+j)+str(i+1))
            exit()

Submission status: Accepted

Solution code:
H,W = map(int,input().split())
src = [list(input().split()) for i in range(H)]

for i in range(H):
    row = src[i]
    if 'snuke' in row:
        j = row.index('snuke')
        print(chr(ord('A') + j) + str(i+1))
        exit()

Submission status: Accepted

Solution code:
H,W=map(int,input().split())
S=[[s for s in input().split()] for i in range(H)]
alpha=['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']
for i in range(H):
    for j in range(W):
        #print(S[i][j],1)
        if S[i][j]=="snuke":
            s=i
            t=j
            break
print(alpha[t]+str(s+1))