Submission #6157188
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define fi first #define endl "\n" #define se second #define ll long long //priority_queue<int, vector<int>, greater<int> > pq; #define _CRT_SECURE_NO_DEPRECATE const int N = 30030; #define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end))) const ll mod = 1e9+7; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,m,x,y; cin>>n>>m; string ss="snuke"; rep(i,0,n) { rep(j,0,m) { string s; cin>>s; if(ss==s) { x=i; y=j; } } } char c='A'; c+=y; cout<<c<<x+1<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | Zoro627 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 696 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 |