Submission #991313


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include<map>
#include <iomanip>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
using namespace std;
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
#define LONGINF 1000000000000000000
int main() {
	ios::sync_with_stdio(false);
	int a, b;
	cin >> a >> b;
	REP(i, a) {
		REP(q, b) {
			string c;
			cin >> c;
			if (c == "snuke") {
				cout << (char)('A' + q) << i + 1 << endl;
				return 0;
			}
		}
	}
}

Submission Info

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