Submission #991492


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define len(val) static_cast<long long>(val.size())
#define rep(i, n) for(int i=0; i<(n); i++)
typedef long long ll;
typedef pair<int, int> P;


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

    string s = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    int H, W;
    cin >> H >> W;
    string ans = "";
    for(int i=0; i<H; i++){
      for(int j=0; j<W; j++){
        string t;
        cin >> t;
        if(t == "snuke"){
          ans += s[j];
          ans += to_string(i+1);
        }
      }
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task A - Where's Snuke?
User haraduka
Language C++14 (GCC 5.4.1)
Score 100
Code Size 608 Byte
Status AC
Exec Time 8 ms
Memory 764 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 AC 8 ms 764 KB
01-02.txt AC 3 ms 256 KB
01-03.txt AC 2 ms 256 KB
01-04.txt AC 2 ms 256 KB
01-05.txt AC 3 ms 256 KB
01-06.txt AC 3 ms 256 KB
01-07.txt AC 3 ms 256 KB
sample-01.txt AC 3 ms 256 KB
sample-02.txt AC 2 ms 256 KB