Submission #991494


Source Code Expand

Copy
#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef long double LD;
typedef pair<LD, int> PLDI;
typedef pair<LD, LD> PLDLD;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define CLR(a) memset((a), 0 ,sizeof(a))
#define ALL(a) a.begin(),a.end()
const int INF = (1e9);
const LL MOD = 1e9+7;
const double PI=atan2(0,-1);


int main()
{
    int h,w;
    cin>>h>>w;
    string s;
    int x,y;
    REP(j,h)
    REP(i,w)
    {
        cin>>s;
        if(s=="snuke")
        {
            x=i;
            y=j;
        }
    }
    cout<<(char)(x+'A')<<y+1<<endl;
}

Submission Info

Submission Time
Task A - Where's Snuke?
User suginamiku
Language C++14 (GCC 5.4.1)
Score 100
Code Size 701 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