Submission #991318
Source Code Expand
import java.io.IOException; import java.io.InputStream; import java.io.PrintStream; import java.util.NoSuchElementException; public class Main { static FastScanner sc = new FastScanner(); static PrintStream out = System.out; public static void main(String args[]) { int H = ni(); int W = ni(); for (int i=0;i<H;i++) { for (int j=0;j<W;j++) { String s = next(); if (s.equals("snuke")) { System.out.printf("%c%d\n", 'A' + j, i+1); } } } } private static String next() { return sc.next(); } private static int ni() { return sc.nextInt(); } private static long nl() { return sc.nextLong(); } private static int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++) a[i] = ni(); return a; } private static long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++) a[i] = ni(); return a; } private static double nd() { return Double.parseDouble( next() ); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } }
Submission Info
Submission Time | |
---|---|
Task | A - Where's Snuke? |
User | yamatchan |
Language | Java8 (OpenJDK 1.8.0) |
Score | 100 |
Code Size | 3665 Byte |
Status | AC |
Exec Time | 116 ms |
Memory | 8656 KB |
Judge Result
Set Name | sample | all | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 104 ms | 8272 KB |
01-02.txt | AC | 103 ms | 8276 KB |
01-03.txt | AC | 104 ms | 8272 KB |
01-04.txt | AC | 114 ms | 8400 KB |
01-05.txt | AC | 111 ms | 8656 KB |
01-06.txt | AC | 104 ms | 8532 KB |
01-07.txt | AC | 106 ms | 8528 KB |
sample-01.txt | AC | 116 ms | 8400 KB |
sample-02.txt | AC | 104 ms | 8276 KB |