Submission #991375
Source Code Expand
#include <iostream> #include <string> #include <sstream> #include <algorithm> #include <vector> #include <utility> #include <functional> #include <stack> #include <queue> #include <map> #include <set> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <deque> #include <ctime> using namespace std; #define rep(i,n) REP(i,0,n) #define REP(i,s,e) for(int i=(s); i<(int)(e); i++) #define pb push_back #define mp make_pair #define all(r) r.begin(),r.end() #define rall(r) r.rbegin(),r.rend() #define fi first #define se second #define println(X) cout<<X<<endl; #define DBG(X) cout<<#X<<" : "<<X<<endl; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vii; typedef vector<ll> vl; typedef vector<vl> vll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll MOD = 1e9 + 7; double EPS = 1e-8; const double PI = acos(-1); int main(){ int h, w; cin>>h>>w; string s[100][100]; rep(i, h) rep(j, w){ cin>>s[i][j]; } rep(i, h) rep(j, w){ if(s[i][j] == "snuke"){ cout<<(char)('A'+j)<<i+1<<endl; } } }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | T1610 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1148 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 892 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 28 ms | 892 KB |
01-02.txt | AC | 2 ms | 256 KB |
01-03.txt | AC | 3 ms | 384 KB |
01-04.txt | AC | 3 ms | 256 KB |
01-05.txt | AC | 3 ms | 384 KB |
01-06.txt | AC | 3 ms | 384 KB |
01-07.txt | AC | 3 ms | 384 KB |
sample-01.txt | AC | 3 ms | 384 KB |
sample-02.txt | AC | 3 ms | 256 KB |