Submission #991380


Source Code Expand

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

typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second

int main()
{
    int h,w;
    cin >>h >>w;
    string s[26][26];
    rep(i,h)rep(j,w) cin >>s[i][j];

    rep(i,h)rep(j,w)
    {
        if(s[i][j]=="snuke")
        {
            printf("%c%d\n", j+'A',i+1);
            break;
        }
    }

    return 0;
}

Submission Info

Submission Time
Task A - Where's Snuke?
User imulan
Language C++14 (GCC 5.4.1)
Score 100
Code Size 584 Byte
Status AC
Exec Time 50 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 50 ms 764 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 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 3 ms 256 KB