Submission #991480
Source Code Expand
#include <cstdio> #include <climits> #include <iostream> #include <string> #include <algorithm> #include <numeric> #include <functional> #include <tuple> #include <list> #include <map> #include <queue> #include <stack> #include <set> #include <vector> #define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++) using namespace std; typedef long long ll; typedef pair<int,int> PI; typedef pair<ll,ll> PL; typedef vector<int> VI; typedef vector<ll> VL; int main() { int H, W; cin >> H >> W; int ii = 0, jj = 0; REP(i,0,H) { REP(j,0,W) { string s; cin >> s; if(s == "snuke") { ii = i; jj = j; } } } cout << (char)('A' + jj) << (ii+1) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | minus3theta |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 761 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 | 2 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 |