Submission #1604724


Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
const int MAX_N=10000;
int h,w;
string s;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> h >> w;
	REP(i,1,h+1) REP(j,0,w){
		cin >> s;
		if(s=="snuke"){
			cout << (char)('A'+j) << i << endl;
			return 0;
		}
	}
	
	return 0;
}

Submission Info

Submission Time
Task A - Where's Snuke?
User ecasdqina
Language C++14 (GCC 5.4.1)
Score 100
Code Size 436 Byte
Status AC
Exec Time 1 ms
Memory 256 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 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 1 ms 256 KB
01-05.txt AC 1 ms 256 KB
01-06.txt AC 1 ms 256 KB
01-07.txt AC 1 ms 256 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB