Submission #11626343
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define rep(i, n) for(int i=0; i<n; i++) #define rep1(i, n) for(int i=1; i<=n; i++) #define repr(i, n) for(int i=n-1; i>=0; i--) #define repr1(i, n) for(int i=n; i>=1; i--) #define all(v) v.begin(),v.end() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; const int INF = 1e9; const ll LLINF = 1e18; const ll MOD = 1e9+7; const double EPS = 1e-10; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } int h, w; string s[30][30]; int main() { cin >> h >> w; rep(i, h) rep(j, w) cin >> s[i][j]; rep(i, h) rep(j, w) { if (s[i][j] == "snuke") { printf("%c%d\n", 'A' + j, i + 1); return 0; } } }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | bokeh |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 939 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 |