Submission #2868646


Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define _for(a,b,i) for(int i=a;i<=b;i++)
#define for1(a,b,i) for(int i=a;i<b;i++)
using namespace std;
ll ma=0x80000000;
ll mi=0x7fffffff;
const ll zfc=0xffffffff;
const ll mod=1e9+7;
inline void input(ll &x)
{
    x=0;
    int f=1;
    char ch=getchar();
    while(!isdigit(ch))
	{
		if(ch=='-')f=-f;
		ch=getchar();
	}
    while(isdigit(ch))
	{
		x=x*10+(ch-'0');
		ch=getchar();
	}
    x*=f;
}
inline void output(ll x)
{
	if(x<0)
    {
        x=-x;
        putchar('-');
    }
    if(x/10>0)output(x/10);
    putchar(x%10+'0');
}
string st;
ll s,n,m;
char ch;
string a="snuke",b="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
int main()
{
	ios::sync_with_stdio(false);
	input(n),input(m);
	_for(1,n,i)
	{
		_for(1,m,j)
		{
			cin>>st;
			if(st==a)
			{
				cout<<b[j-1]<<i<<endl;
				return 0;
			}
		}
	}
    return 0;
}

Submission Info

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

Judge Result

Set Name sample all
Score / Max Score 0 / 0 0 / 100
Status
WA × 2
WA × 11
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, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt WA 1 ms 256 KB
01-02.txt WA 1 ms 256 KB
01-03.txt WA 1 ms 256 KB
01-04.txt WA 1 ms 256 KB
01-05.txt WA 1 ms 256 KB
01-06.txt WA 1 ms 256 KB
01-07.txt WA 1 ms 256 KB
sample-01.txt WA 1 ms 256 KB
sample-02.txt WA 1 ms 256 KB