Submission #991317


Source Code Expand

#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
using namespace std;
using ld = long double;
const ld eps = 1e-9;

int main() {
	int H, W; cin >> H >> W;
	vector<vector<string>>sts(H, vector<string>(W));
	for(int i = 0; i < H; ++i) {
		for (int j = 0; j < W; ++j) {
			cin >> sts[i][j];
			if (sts[i][j] == "snuke") {
				cout << char('A' + j) << i + 1 << endl;
			}
		}
	}
	return 0;
}

Submission Info

Submission Time
Task A - Where's Snuke?
User yuma000
Language C++14 (GCC 5.4.1)
Score 100
Code Size 430 Byte
Status AC
Exec Time 59 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 59 ms 764 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