Submission #4741113

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>

using namespace std;
int main()
{
	int H, W;
	cin >> H >> W;
	string base;
	for (int x = 0; x < H; x++) {
		for (int y = 0; y < W; y++) {
			cin >> base;
			if (base.find("snuke") != string::npos) {
				printf("%c", y + 'A');
				cout << x + 1;
				return 0;
			}
		}
	}
}

Submission Info

Judge Result