Submission #5664887

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define INF 999999999999999999
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
using namespace std;
int main(int argc, char const *argv[])
{
    int h, w;
    string tmp;
    int ans1, ans2;
    cin >> h >> w;
    rep(i, h)
    {
        rep(j, w)
        {
            cin >> tmp;
            if (tmp[0] == 's' && tmp[1] == 'n' && tmp[2] == 'u' && tmp[3] == 'k' && tmp[4] == 'e')
            {

                ans1 = i;
                ans2 = j;
            }
        }
    }
    cout << char('A' + ans2) << ans1 + 1 << endl;
    return 0;
}

Submission Info

Judge Result