Submission #5421503

---

Source Code Expand

#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,int> pli;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
  int h,w;
  cin >> h >> w;
  string s[h][w];
  rep(i,h){
    rep(j,w)cin >> s[i][j];
  }
  rep(i,h){
    rep(j,w){
      if(s[i][j]=="snuke"){
        int x=i+1;
        char y='A'+j;
        cout << y << x << endl;
      }
    }
  }
return 0;}

Submission Info

Judge Result