Submission #1101893


Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;i++)

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 27;

string a[MAX_N][MAX_N];

int main()
{
	int n,m;
	cin >> n >> m;
	rep(i,n){
		rep(j,m){
			cin >> a[i][j];
		}
	}
	rep(i,n){
		rep(j,m){
			if(a[i][j] == "snuke"){
				cout << (char)('A' + j) << i+1 << "\n";
				break;
			}
		}
	}
}

Submission Info

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

Judge Result

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