Submission #3627083
Source Code Expand
#include<iostream> #include<cstdio> #include<string> #include<math.h> #include<algorithm> #include<vector> #include<iomanip> #include<map> #include<numeric> #include<queue> #include<functional> #include<cassert> #include<set> #define rep(a,b) for(int a=0;a<b;++a) #define REP(a,b,c,d) for(int a=b;a<c;a+=d) #define yes cout<<"Yes"<<endl #define no cout<<"No"<<endl #define mod 1000000007 using namespace std; using ll = long long; using p_i = pair<int, int>; int main() { int H, W; cin >> H >> W; rep(i, H) { rep(j, W) { string str; cin >> str; if (str == "snuke") { cout << (char)('A' + j) << i + 1 << endl; return 0; } } } }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | oka_no |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 686 Byte |
Status | AC |
Exec Time | 2 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, sample-01.txt, sample-02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 1 ms | 256 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | AC | 2 ms | 256 KB |
01-06.txt | AC | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |