Submission #13612376


Source Code Expand

Copy
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

//container util
#define SORT(c) sort((c).begin(),(c).end())
#define all(a) (a).begin(), (a).end()

//repetition
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//print
#define pv(val) cerr << #val << '=' << (val) << endl

const int INF = 1e9;

int main(void){

	int H, W; cin >> H >> W;
	int y, x;
	REP(i,H){
		REP(j,W){
			string s; cin >> s;
			if(s == "snuke"){
				y = i;
				x = j;
			}
		}
	}
	
	cout << (char)(x +'A') << y+1 << endl;

	return 0;

}

Submission Info

Submission Time
Task A - Where's Snuke?
User hntk03
Language C++14 (GCC 5.4.1)
Score 100
Code Size 590 Byte
Status
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Score / Max Score Test Cases
sample 0 / 0 sample-01.txt, sample-02.txt
all 100 / 100 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 1 ms 256 KB
01-02.txt 1 ms 256 KB
01-03.txt 1 ms 256 KB
01-04.txt 1 ms 256 KB
01-05.txt 2 ms 256 KB
01-06.txt 1 ms 256 KB
01-07.txt 1 ms 256 KB
sample-01.txt 1 ms 256 KB
sample-02.txt 1 ms 256 KB