Submission #991314
Source Code Expand
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i=0;i<((int)(n));i++)
#define reg(i,a,b) for(int i=((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i=((int)(n))-1;i>=0;i--)
#define ireg(i,a,b) for(int i=((int)(b));i>=((int)(a));i--)
typedef long long int lli;
typedef pair<int,int> mp;
#define fir first
#define sec second
#define IINF INT_MAX
#define LINF LLONG_MAX
#define eprintf(...) fprintf(stderr,__VA_ARGS__)
#define pque(type) priority_queue<type,vector<type>,greater<type> >
#define memst(a,b) memset(a,b,sizeof(a))
#define iter(v,ite) for(auto ite=(v).begin();ite!=(v).end();ite++)
#define mimunum(v,x) distance((v).begin(),lower_bound((v).begin(),(v).end(),x))
int h,w;
int main(void){
scanf("%d%d",&h,&w);
rep(y,h){
rep(x,w){
char s[100];
scanf("%s",s);
if(strcmp(s,"snuke")==0){
printf("%c%d\n",x+1+'A',y+1);
}
}
}
return 0;
}
Submission Info
Submission Time
2016-11-26 12:31:51+0900
Task
A - Where's Snuke?
User
satos
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1109 Byte
Status
WA
Exec Time
43 ms
Memory
764 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:31:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&h,&w);
^
./Main.cpp:35:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",s);
^
Judge Result
Set Name
sample
all
Score / Max Score
0 / 0
0 / 100
Status
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
WA
43 ms
764 KB
01-02.txt
WA
2 ms
256 KB
01-03.txt
WA
2 ms
256 KB
01-04.txt
WA
2 ms
256 KB
01-05.txt
WA
3 ms
256 KB
01-06.txt
WA
2 ms
256 KB
01-07.txt
WA
2 ms
256 KB
sample-01.txt
WA
2 ms
256 KB
sample-02.txt
WA
2 ms
256 KB