Submission #7049581
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define rep(i,n) for(int i=0;i<(n);++i) #define reps(i,n) for(int i=1;i<=(n);++i) #define all(x) (x).begin(),(x).end() #define int long long #define mk_p(a,b) make_pair((a),(b)) using pii = pair<int,int>; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; int gcd(int a,int b){return b ? gcd(b,a%b) : a;} int lcm(int a,int b){return a/gcd(a,b)*b;} string s[100][100]; signed main(){ cin.tie(0); ios::sync_with_stdio(false); int h,w; char a = 'A'; cin >> h >> w; reps(i,h){ rep(j,w){ cin >> s[i][j]; } } reps(i,h){ rep(j,w){ if(s[i][j] == "snuke"){ cout << char(a + j) << i << '\n'; return 0; } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | uryo1903 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 971 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 384 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 | 384 KB |
01-02.txt | AC | 1 ms | 384 KB |
01-03.txt | AC | 1 ms | 384 KB |
01-04.txt | AC | 1 ms | 384 KB |
01-05.txt | AC | 1 ms | 384 KB |
01-06.txt | AC | 1 ms | 384 KB |
01-07.txt | AC | 1 ms | 384 KB |
sample-01.txt | AC | 1 ms | 384 KB |
sample-02.txt | AC | 1 ms | 384 KB |