Submission #991292
Source Code Expand
#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <queue> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> using namespace std; typedef long long ll; typedef unsigned long long ull; static const double EPS = 1e-8; static const double PI = 4.0 * atan(1.0); static const double PI2 = 8.0 * atan(1.0); #define REP(i,n) for(int i=0;i<(int)n;++i) #define ALL(c) (c).begin(),(c).end() #define CLEAR(v) memset(v,0,sizeof(v)) #define MP(a,b) make_pair((a),(b)) #define ABS(a) ((a)>0?(a):-(a)) #define FOR(i,s,n) for(int i=s;i<(int)n;++i) int main(int argc, char **argv) { int H, W; cin >> H >> W; string s; REP(y, H) REP(x, W) { cin >> s; if (s == "snuke") { cout << ('A' + x) << (y + 1) << endl; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | yupotown |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1070 Byte |
Status | WA |
Exec Time | 10 ms |
Memory | 764 KB |
Judge Result
Set Name | sample | all | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 10 ms | 764 KB |
01-02.txt | WA | 3 ms | 256 KB |
01-03.txt | WA | 3 ms | 256 KB |
01-04.txt | WA | 3 ms | 256 KB |
01-05.txt | WA | 3 ms | 256 KB |
01-06.txt | WA | 3 ms | 256 KB |
01-07.txt | WA | 3 ms | 256 KB |
sample-01.txt | WA | 3 ms | 256 KB |
sample-02.txt | WA | 3 ms | 256 KB |