Submission #7912989


Source Code Expand

import java.util.*;
public class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int h = sc.nextInt();
    int w = sc.nextInt();
    char[] c = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
    for(int i = 1;i <= h;i++){
      for(int j = 0;j<=w-1;j++){
        String s = sc.next();
        if(s.equals("snuke"))System.out.println(String.valueOf(c[j])+String.valueOf(i));
      }
    }
  }
}

Submission Info

Submission Time
Task A - Where's Snuke?
User patron
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 512 Byte
Status AC
Exec Time 117 ms
Memory 21460 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 95 ms 21332 KB
01-02.txt AC 95 ms 21460 KB
01-03.txt AC 94 ms 18644 KB
01-04.txt AC 94 ms 18644 KB
01-05.txt AC 117 ms 21332 KB
01-06.txt AC 103 ms 19412 KB
01-07.txt AC 102 ms 19156 KB
sample-01.txt AC 99 ms 19540 KB
sample-02.txt AC 92 ms 18636 KB