Submission #2868656
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; string st; ll s,n,m; string a="snuke",b="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; int main() { cin>>n>>m; for(int i=1;i<=n;i++) { for(int j=0;j<m;j++) { cin>>st; if(st==a) { cout<<b[j]<<i<<endl; return 0; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | luogu_bot4 |
Language | C++ (GCC 5.4.1) |
Score | 100 |
Code Size | 505 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
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, sample-01.txt, sample-02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 1 ms | 256 KB |
01-04.txt | AC | 1 ms | 256 KB |
01-05.txt | AC | 1 ms | 256 KB |
01-06.txt | AC | 1 ms | 256 KB |
01-07.txt | AC | 1 ms | 256 KB |
sample-01.txt | AC | 1 ms | 256 KB |
sample-02.txt | AC | 1 ms | 256 KB |