Submission #1538649

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <time.h>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cassert>

using namespace std;

const int N = 50005;
const int inf = 1000 * 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;

int n,m;
char answ1;
int answ2;

int main(){
    cin>>n>>m;
    char x = char('A' + m - 1);
    for(int i=1;i<=n;i++){
        for(char j='A';j<=x;j++){
            string s;
            cin>>s;
            if(s == "snuke"){
                answ1 = j;
                answ2 = i;
            }
        }
    }
    cout<<answ1<<answ2<<endl;
    return 0;
}

Submission Info

Judge Result