Submission #991813
Source Code Expand
#include <iostream> #include <cstdio> #include <vector> #include <queue> #include <set> #include <stack> #include <map> #include <string> #include <array> #include <deque> #include <iomanip> #include <bitset> #include <complex> #include <sstream> #include <algorithm> #include <limits> #include <cmath> #include <utility> #include <tuple> #include <numeric> #include <cassert> using namespace std; using ll = long long; using ld = long double; using P = pair<int, int>; template <typename T> constexpr T INF = "Undefined"; template <> constexpr int INF<int> = 1e9; template <> constexpr ll INF<ll> = 1e18; template <> constexpr ld INF<ld> = 1e30; constexpr int mod = 1e9+7; constexpr ld eps = 1e-10; constexpr ld pi = acos(-1.0); #define DUMP(a) cout << #a << ": " << (a) << endl int main() { int W, H; cin >> H >> W; int cnt = 0; for(int i=0; i<H; ++i) { for(int j=0; j<W; ++j) { string S; cin >> S; if(S == "snuke") { cout << (char)('A' + j) << i+1 << endl; return 0; } } } }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | Suibaka |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1160 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 2 ms | 256 KB |
01-02.txt | AC | 2 ms | 256 KB |
01-03.txt | AC | 2 ms | 256 KB |
01-04.txt | AC | 2 ms | 256 KB |
01-05.txt | AC | 2 ms | 256 KB |
01-06.txt | AC | 2 ms | 256 KB |
01-07.txt | AC | 2 ms | 256 KB |
sample-01.txt | AC | 2 ms | 256 KB |
sample-02.txt | AC | 2 ms | 256 KB |