Submission #991362


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(), (x).end()

typedef long long ll;
typedef long double ld;

const int INF = 1e9;
const ld EPS = 1e-8;

int main(){
  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") continue;
    string res;
    res += 'A' + j;
    res += '0' + i + 1;
    cout << res << endl;
  }
  return 0;
}

Submission Info

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

Judge Result

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