Submission #992249
Source Code Expand
#include <bits/stdc++.h> #define rep(i,n) for(int i = 0; i < n; i++) #define repp(i, m, n) for(int i = m; i < n; i++) const int INF = 100000000; const double EPS = 1e-10; const int MOD = 1000000007; using namespace std; typedef long long ll; typedef pair<int, int> pai; typedef pair<ll,ll> pal; int main() { int h, w; cin >> h >> w; string s; rep(i, h) { rep(j, w) { cin >> s; if(s=="snuke") { char t='A'; t+=j; cout << t << 1+i << endl; break; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | kurowassann |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 541 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 KB |
Judge Result
Set Name | sample | all | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 |