Submission #991411

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define REP(i,s,n) for(int i=s; i<n; ++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX

typedef long long ll;
typedef pair<int, int> ii;

/*
class Node {
public:
  int num;
  int index;
  bool operator<(const Node& b) const {
    if(num < b.num) return (num < b.num);
    else return index > b.index;
  }

  Node(){
    num=0; index=0;
  }
  Node(int n, int i) : num(n), index(i){
  }
};
*/

int main(){

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

  return 0;
}

Submission Info

Judge Result