Submission #991487


Source Code Expand

Copy
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
using namespace std;

#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<((x))<<endl
#define fi first
#define se second

#define INF 2147483600

int main(){
  int h,w;
  cin>>h>>w;
  rep(i,h) rep(j,w){
    string str;
    cin>>str;
    if(str=="snuke"){
      printf("%c%d\n", 'A'+j, i+1);
    }
  }

  return 0;
}

Submission Info

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

Judge Result

Set Name sample all
Score / Max Score 0 / 0 100 / 100
Status
× 2
× 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