Submission #2365986
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; using vi = vector<int>; using vvi = vector<vi>; using vs = vector<string>; using msi = map<string, int>; using mii = map<int, int>; using psi = pair<string, int>; using pii = pair<int, int>; using vlai = valarray<int>; #define rep(i,n) for(int i=0;i<n;i++) #define range(i,s,n) for(int i=s;i<n;i++) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define fs first #define sc second #define pb push_back #define eb emplace_back #define mp make_pair #define INF 1E9 #define EPS 1E-9 #define MOD (1E9+7) #define PI 3.1415926535897932384 std::ostream &operator<<(std::ostream &out, const vector<int> &tgt) { string s; for (int i = 0; i<tgt.size(); i++) { s += (to_string(tgt[i]) + ((i != tgt.size() - 1) ? " " : "")); } out << s; return out; } int main() { int h, w, n = 0;; cin >> h >> w; string s; while (1) { cin >> s; if (s == "snuke") { cout << (char)('A' + (n%w)) << (n / w) +1<< endl; return 0; } else n++; } }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | makecir |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1077 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 |