Submission #2982670

---

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<climits>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<iomanip>
using namespace std;

#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define erep(i,j,n) for(int i=(j);i<=(n);i++)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define INF 1e9
const int mod = 1e9+7;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef pair<int, int> pi;
typedef long long i64;

int main() {
  int H,W;
  cin>>H>>W;
  vvs s(H,vs(W));
  rep(i,0,H) rep(j,0,W) cin>>s[i][j];

  string a="ABCDEFGHIGKLMNOPQRSTUVWXYZ";
  rep(h,0,H){
    rep(w,0,W){
      if(s[h][w]=="snuke"){
        cout<<a[w]<<h+1<<endl;
        return 0;
      }
    }
  }
}

Submission Info

Judge Result