Submission #991465
Source Code Expand
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define Fst first
#define Snd second
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#define M4P(a , b , c , d) make_pair(make_pair((a) , (b)) , make_pair((c) , (d)))
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)
#define repv(t,it,v) for(vector<t>::iterator it = v.begin() ; it != v.end() ; ++it)
int h,w;
int main(){
scanf("%d%d" , &h , &w);
repp(i,0,h){
repp(j,0,w){
char s[10];
scanf(" %s" , s);
if(s[0] == 's' && s[1] == 'n' && s[2] == 'u' && s[3] == 'k' && s[4] == 'e'){
printf("%c%d\n" , 'A' + j , i + 1);
}
}
}
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Where's Snuke? |
User |
PIandS |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1018 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
128 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:27:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d" , &h , &w);
^
./Main.cpp:31:20: 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 |
100 / 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 |
AC |
1 ms |
128 KB |
01-02.txt |
AC |
1 ms |
128 KB |
01-03.txt |
AC |
1 ms |
128 KB |
01-04.txt |
AC |
1 ms |
128 KB |
01-05.txt |
AC |
1 ms |
128 KB |
01-06.txt |
AC |
1 ms |
128 KB |
01-07.txt |
AC |
1 ms |
128 KB |
sample-01.txt |
AC |
1 ms |
128 KB |
sample-02.txt |
AC |
1 ms |
128 KB |