Contest Duration: ~ (local time) (180 minutes)

Submission #991499

Source Code Expand

Copy
```#include <bits/stdc++.h>
using namespace std;
#define int long long   // <-----!!!!!!!!!!!!!!!!!!!

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(a)-1;i>=b;i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define printV(_v) for(auto _x:_v){cout<<_x<<" ";}cout<<endl
#define printVS(_vs) for(auto _x : _vs){cout << _x << endl;}
#define printVV(_vv) for(auto _v:_vv){for(auto _x:_v){cout<<_x<<" ";}cout<<endl;} cout << endl;
#define printP(_p) cout << _p.first << " " << _p.second << endl
#define printVP(_vp) for(auto _p : _vp) printP(_p);

typedef long long ll;
typedef pair<int, int> Pii;
typedef tuple<int, int, int> TUPLE;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<Pii> vp;
const int inf = 1e9;
const int mod = 1e9 + 7;

signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);

int H, W;
cin >> H >> W;
vector<vector<string>> s(H, vector<string>(W));
rep(i, H) rep(j, W) cin >> s[i][j];

rep(i, H) {
rep(j, W) {
if (s[i][j] == "snuke") {
cout << char('A' + j) << i + 1 << endl;
return 0;
}
}
}
}
```

#### Submission Info

Submission Time 2016-11-26 12:33:42+0900 A - Where's Snuke? yurahuna C++14 (GCC 5.4.1) 100 1357 Byte AC 3 ms 256 KB

#### Judge Result

Set Name sample all
Score / Max Score 0 / 0 100 / 100
Status
 AC × 2
 AC × 9
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 3 ms 256 KB
01-02.txt 3 ms 256 KB
01-03.txt 3 ms 256 KB
01-04.txt 3 ms 256 KB
01-05.txt 3 ms 256 KB
01-06.txt 3 ms 256 KB
01-07.txt 3 ms 256 KB
sample-01.txt 3 ms 256 KB
sample-02.txt 3 ms 256 KB