Submission #6325910


Source Code Expand

Copy
import std.stdio, std.algorithm, std.conv, std.array, std.string, std.math, std.typecons, std.numeric;

enum AB = "ABCDEFGHIJKLMNOPQRSTUVWXYZ".to!(char[]);

void main()
{
    auto hw = readln.split.to!(int[]);
    auto H = hw[0];
    foreach (i; 0..H) {
        foreach (j, w; readln.split.to!(string[])) {
            if (w == "snuke") {
                writefln("%c%d", AB[j], i+1);
            }
        }
    }
}

Submission Info

Submission Time
Task A - Where's Snuke?
User cedretaber
Language D (DMD64 v2.070.1)
Score 100
Code Size 431 Byte
Status
Exec Time 1 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, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt 1 ms 256 KB
01-02.txt 1 ms 256 KB
01-03.txt 1 ms 256 KB
01-04.txt 1 ms 256 KB
01-05.txt 1 ms 256 KB
01-06.txt 1 ms 256 KB
01-07.txt 1 ms 256 KB
sample-01.txt 1 ms 256 KB
sample-02.txt 1 ms 256 KB