Submission #1800784
Source Code Expand
#include <iostream> #include <iomanip> // << fixed << setprecision(xxx) #include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ; #include <vector> #include <string> // to_string(nnn) // substr(m, n) // stoi(nnn) #include <complex> #include <tuple> // get<n>(xxx) #include <queue> #include <stack> #include <map> // if (M.find(key) != M.end()) { } #include <set> // S.insert(M); // if (S.find(key) != S.end()) { } // for (auto it=S.begin(); it != S.end(); it++) { } // auto it = S.lower_bound(M); #include <random> // random_device rd; mt19937 mt(rd()); #include <cctype> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> // atoi(xxx) using namespace std; #define DEBUG 0 // change 0 -> 1 if we need debug. // insert #if<tab> by my emacs. #if DEBUG == 1 ... #end typedef long long ll; // const int dx[4] = {1, 0, -1, 0}; // const int dy[4] = {0, 1, 0, -1}; // const int C = 1e6+10; // const ll M = 1000000007; int main () { int H, W; cin >> H >> W; string S[110][110]; for (auto i = 0; i < H; ++i) { for (auto j = 0; j < W; ++j) { cin >> S[i][j]; } } for (auto i = 0; i < H; ++i) { for (auto j = 0; j < W; ++j) { if (S[i][j] == "snuke") { cout << (char)('A' + j); cout << i+1 << endl; } } } }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | kazunetakahashi |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1350 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 384 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 | 384 KB |
01-02.txt | AC | 1 ms | 384 KB |
01-03.txt | AC | 1 ms | 384 KB |
01-04.txt | AC | 1 ms | 384 KB |
01-05.txt | AC | 2 ms | 384 KB |
01-06.txt | AC | 2 ms | 384 KB |
01-07.txt | AC | 2 ms | 384 KB |
sample-01.txt | AC | 2 ms | 384 KB |
sample-02.txt | AC | 1 ms | 384 KB |