Submission #991339
Source Code Expand
#include <bits/stdc++.h> #define mp make_pair #define mt make_tuple #define rep(i,n) for(int i=0;i<(n);i++) using namespace std; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; const int INF=1<<29; const double EPS=1e-9; const ll MOD = 1000000007; const int dx[]={1,0,-1,0},dy[]={0,-1,0,1}; int H,W; int main(){ cin >> H >> W; for (int i = 0; i < H; i++){ for (int j = 0; j < W; j++){ string str; cin >> str; if (str == "snuke"){ char row = 'A' + j; cout << row << i + 1 << endl; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | togatoga |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 619 Byte |
Status | AC |
Exec Time | 56 ms |
Memory | 764 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 | 56 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 |