Submission #4792202


Source Code Expand

#include <cstdio>
#include <cstring>
#include <vector>
#include <iostream>
#include <functional>
#include <algorithm>
#include <queue>
#include <string>
#include <set>

using namespace std;
using ii = pair<int, int>;

int N, M, K;
int tcase;

int ansN, ansM;

int main()
{
	cin >> N >> M;
	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= M; j++)
		{
			string in;
			cin >> in;
			if (in == "snuke")
			{
				ansN = i;
				ansM = j;
			}
		}
	}

	printf("%c%d", ansM + 'A' - 1, ansN);
}

Submission Info

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