Submission #1994820
Source Code Expand
#include "bits/stdc++.h" #define rep(a,b) for(int a = 0;a < b;a++) #define REP(i, x, n) for(int i = x; i < n; i++) #define P(a) cout << a << endl #define pb(a) push_back(a) #define mp(a,b) make_pair(a,b) #define ssort(v) sort(v.begin(),v.end()) #define rev(v) reverse(v.begin(),v.end()) #define vP(v) for(int i = 0;i < v.size();i++){cout << v[i];if(i != v.size()-1)cout << endl;} #define vcin(v,n) rep(i,n){int a;cin >> a;v.pb(a);} using namespace std; typedef long long ll; typedef unsigned long long ull; int dx[] = { 1, -1 , 0 , 0 }; int dy[] = { 0, 0, 1, -1 }; ll MOD = 1000000007; void solve(){ int a,b; cin >> a >> b; rep(i,a){ rep(j,b){ string s; cin >> s; if(s == "snuke"){ cout << (char)('A'+j) << i+1 << endl; } } } } int main() { solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | pantacia1128 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 841 Byte |
Status | AC |
Exec Time | 2 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 | 2 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 |