Submission #3907558
Source Code Expand
#include <iostream> #include <cstdio> #include <string> using namespace std; int main() { int h, w; int ans_h, ans_w; string mas[30][30]; cin >> h >> w; for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { cin >> mas[i][j]; } } ans_h = 0; ans_w = 0; while (ans_h < h && mas[ans_h][ans_w] != "snuke") { ans_w = 0; while(ans_w < w && mas[ans_h][ans_w] != "snuke") { ans_w++; } if (mas[ans_h][ans_w] != "snuke") { ans_h++; } } printf("%c%d\n", 'A' + (char)ans_w, ans_h + 1); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | toyama |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 678 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 |