Submission #991407
Source Code Expand
#include <iostream> #include <sstream> #include <vector> #include <string> #include <cstring> #include <algorithm> #include <queue> #include <map> #include <set> #define REP(i,k,n) for(int i=k;i<n;i++) #define rep(i,n) for(int i=0;i<n;i++) #define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++) #define INF 1<<30 #define mp make_pair using namespace std; typedef long long ll; typedef pair<int,int> P; int main() { int h, w; cin >> h >> w; vector<string> v[h]; rep(i, h) { rep(j, w) { string s; cin >> s; v[i].push_back(s); } } rep(i, h) { rep(j, w) { if(v[i][j] == "snuke") { cout << char('A' + j) << i + 1 << endl; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | Ry0u_ |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 742 Byte |
Status | AC |
Exec Time | 38 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 | 38 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 |