Submission #1357052
Source Code Expand
#include<iostream> #include<string> #include<cmath> #include<queue> #include<map> #include<set> #include<list> #include<iomanip> #include<vector> #include<functional> #include<algorithm> #include<cstdio> #include<unordered_map> #define int long long #define rep(i,a,n) for (int (i)=(a);(i)<(n);(i)++) using namespace std; typedef long long ll; typedef long double ld; signed main() { /*int n, sum = 0, ans = 0; string s; cin >> s; n = s.size(); for (int i = 0; i < floor(n / 2.0); i++) { if (s[i] == s[n - i - 1]) sum++; } for (int i = 0; i < n; i++) { if (n % 2 == 1 && i == ceil(n / 2.0)-1) continue; for (int j = 0; j < 26; j++) { if ((int)s[i] - 'A' != j) { if (i > floor(n / 2.0) && ((char)j + 'A' != s[i - (floor(n / 2.0))] || (char)j + 'A' == s[i - (floor(n / 2.0))-1] && sum + 1 != (sum - sum % 2) / 2)) { if (sum == 0 || s[i] == s[n - i - 1]) ans++; } else if (i < floor(n / 2.0) && ((char)j + 'A' != s[i - (floor(n / 2.0))] || (char)j + 'A' == s[n-i-1] && sum + 1 != (sum - sum % 2) / 2)) { if (sum == 0 || s[i] == s[n - i - 1]) ans++; } } } } if (n % 2 == 1 && sum == 0) ans += 25; if (n == 1) ans = 0; cout << ans << endl;*/ int h, w; cin >> h >> w; string s; for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { cin >> s; if (s == "snuke") { cout << (char)(j + 'A') << i + 1 << endl; } } } getchar(); getchar(); }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | Thistle |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1490 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 |