Submission #991330
Source Code Expand
#include<iostream> #include<vector> #include<string> #include<cstring> #include<algorithm> #include<map> #include<set> #include<cmath> #include<cassert> #include<queue> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef vector<int> vi; string board[30][30]; int main() { int H, W; cin >> H >> W; for (int i = 0; i < H; i++) { for (int j = 0; j < W; j++) { cin >> board[i][j]; } } for (int i = 0; i < H; i++) { for (int j = 0; j < W; j++) { if (board[i][j] == "snuke") { cout << (char)('A'+j) << i+1 << endl; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | mayoko |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 653 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 | 3 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 |