Submission #6150576


Source Code Expand

"use strict";
    
const main = arg => {
    arg = arg.trim().split("\n");
    const H = parseInt(arg[0].split(" ")[0]);
    const W = parseInt(arg[0].split(" ")[1]);
    
    const words = arg.slice(1, H + 1).map(s=>s.split(" "));
    const alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ".split("");
    
    for(let i=0; i<H; i++) {
        for(let j=0; j<W; j++) {
            if(words[i][j] === "snuke") {
                console.log(alpha[j] + (parseInt(i) + 1));
                return;
            }
        }
    }
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));

Submission Info

Submission Time
Task A - Where's Snuke?
User oimo23
Language JavaScript (node.js v5.12)
Score 100
Code Size 590 Byte
Status AC
Exec Time 56 ms
Memory 7624 KB

Judge Result

Set Name sample all
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 11
Set Name Test Cases
sample sample-01.txt, sample-02.txt
all 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 AC 56 ms 7624 KB
01-02.txt AC 52 ms 7372 KB
01-03.txt AC 53 ms 7372 KB
01-04.txt AC 52 ms 7372 KB
01-05.txt AC 53 ms 7372 KB
01-06.txt AC 52 ms 7372 KB
01-07.txt AC 53 ms 7372 KB
sample-01.txt AC 52 ms 7372 KB
sample-02.txt AC 53 ms 7372 KB