Submission #991473


Source Code Expand

Copy
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <utility>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <istream>
#include <ostream>

#include <cstdlib>
#include <cmath>
#include <cstdio>

using namespace std;

#define fi first
#define se second
#define mkp make_pair
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define rep(i,n) for(ll i=0; i < (n); ++i)
#define rrep(i,n) for(ll i=((n)-1); i >= 0; --i)

#define OPLT(T) bool operator<(const T & lop_, const T & rop_)
#define OPEQ(T) bool operator==(const T & lop_, const T & rop_)

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

//istream& operator>>(istream& istr, __float128& obj) { double d; istr >> d; obj = d; return istr; };
//ostream& operator<<(ostream& ostr, __float128& obj) { ostr << static_cast<double>(obj); return ostr; };

int main() {
	int H, W; cin >> H >> W;
	vector<vector<string> > v;
	v.resize(H);
	rep(i,H) {
		v[i].resize(W);
		rep(j,W) {
			cin >> v[i][j];
			if(v[i][j] == "snuke") {
				cout << (char)(j+'A') << i+1 << endl;
				return 0;
			}
		}
	}

	return 0;
}

Submission Info

Submission Time
Task A - Where's Snuke?
User konjo
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1223 Byte
Status
Exec Time 3 ms
Memory 256 KB

Judge Result

Set Name Score / Max Score Test Cases
sample 0 / 0 sample-01.txt, sample-02.txt
all 100 / 100 sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt
Case Name Status Exec Time Memory
01-01.txt 3 ms 256 KB
01-02.txt 3 ms 256 KB
01-03.txt 2 ms 256 KB
01-04.txt 3 ms 256 KB
01-05.txt 3 ms 256 KB
01-06.txt 3 ms 256 KB
01-07.txt 3 ms 256 KB
sample-01.txt 3 ms 256 KB
sample-02.txt 3 ms 256 KB