Submission #3710539


Source Code Expand

import java.util.Scanner;

class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int H = sc.nextInt(), W = sc.nextInt();
    String[][] S = new String[H][W];
    int ansH = -1,ansW = -1;
    for(int i=0;i<H;i++){
      for(int j=0;j<W;j++){
        S[i][j] = sc.next();
        if(S[i][j].equals("snuke")){
          ansH = i;
          ansW = j;
        }
      }
    }
    System.out.println((char)('A'+ansW)+""+(ansH+1));
  }
}

Submission Info

Submission Time
Task A - Where's Snuke?
User mits58
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 494 Byte
Status AC
Exec Time 120 ms
Memory 23252 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 93 ms 16980 KB
01-02.txt AC 93 ms 21204 KB
01-03.txt AC 95 ms 19924 KB
01-04.txt AC 95 ms 18644 KB
01-05.txt AC 120 ms 19540 KB
01-06.txt AC 100 ms 20052 KB
01-07.txt AC 100 ms 23252 KB
sample-01.txt AC 100 ms 19668 KB
sample-02.txt AC 92 ms 19796 KB