Submission #991493


Source Code Expand

Copy
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
using namespace std;
typedef pair<int, int> P;

signed main(){
    int h, w;
    cin >> h >> w;
    string s;
    int H, W;
    rep(i, 0, h){
        rep(j, 0, w){
            cin >> s;
            if(s == "snuke"){
                H = i + 1;
                W = j + 1;
            }
        }
    }
    cout << (char)('A' + W - 1) << H << endl;
}

Submission Info

Submission Time
Task A - Where's Snuke?
User treeone
Language C++14 (GCC 5.4.1)
Score 100
Code Size 581 Byte
Status
Exec Time 3 ms
Memory 256 KB

Judge Result

Set Name Score / Max Score Test Cases
sample 0 / 0 sample-01.txt, sample-02.txt
all 100 / 100 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