Submission #213348
Source Code Expand
import static java.util.Arrays.deepToString; import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.HashMap; import java.util.List; import java.util.Map; import java.util.Scanner; import java.util.StringTokenizer; public class Main { private static final boolean isDebug = false; void solve() throws Throwable { pw.println(readString().charAt(0)-'A'+1); } private static long gcd(long n1, long n2) { return (n2 == 0)?n1:gcd(n2, n1%n2); } private static int gcd(int n1, int n2) { return (n2 == 0)?n1:gcd(n2, n1%n2); } static long startTime; public static void main(String[] args) { Main app = new Main(); try { app.br = new BufferedReader(new InputStreamReader(System.in)); app.solve(); } catch(Throwable e) { e.printStackTrace(); } finally { try { app.br.close();} catch (Exception igunore) {} } d(System.currentTimeMillis() - startTime + " ms"); pw.flush(); pw.close(); } static final void d(Object ... o) { if (isDebug) pw.println(deepToString(o)); } void permutationAll(int[] p) { permutation(p, 0, p.length - 1); } void permutationRange(int from, int to) { int cnt = to - from + 1; int[] elements = new int[cnt]; for (int i = 0 ; i < cnt; i++) elements[i] = from++; permutation(elements, 0, cnt - 1); } void permutation(int[] elements, int nowCnt, int totalCnt) { if (nowCnt == totalCnt) { // TODO insertCode } else { for (int i = nowCnt; i <= totalCnt; i++) { int tmp = elements[nowCnt]; elements[nowCnt] = elements[i]; elements[i] = tmp; permutation(elements, nowCnt+1, totalCnt); tmp = elements[nowCnt]; elements[nowCnt] = elements[i]; elements[i] = tmp; } } } static PrintWriter pw = new PrintWriter(System.out); private BufferedReader br = null; private StringTokenizer st = null; private String delimiter = null; public String next() { while (st == null || !st.hasMoreTokens()) { if(delimiter != null) { st = new StringTokenizer(readLine(), delimiter); } else { st = new StringTokenizer(readLine()); } } return st.nextToken(); } public void close() { try { this.br.close(); } catch(IOException ioe) { ioe.printStackTrace(); } } public final String readString() { return next(); } public final int readInt() { return Integer.parseInt(next()); } public final long readLong() { return Long.parseLong(next()); } public final double readDouble() { return Double.parseDouble(next()); } public final int[] readIntArray() { String[] s = readStrArray(); int cnt = s.length; int[] out = new int[cnt]; for (int i = 0; i < cnt; i++) out[i] = Integer.parseInt(s[i]); return out; } public final long[] readLongArray() { String[] s = readStrArray(); int cnt = s.length; long[] out = new long[cnt]; for (int i = 0; i < cnt; i++) out[i] = Long.parseLong(s[i]); return out; } public final int[] readIntColumnArray(int N) { int[] res = new int[N]; for (int i = 0; i < N; i++) { res[i] = readInt(); } return res; } public final int[][] readIntMatrix(int N) { int[][] res = new int[N][]; for (int i = 0; i < N; i++) { res[i] = readIntArray(); } return res; } public final char[][] readCharMatrix(int N) { char[][] res = new char[N][]; for (int i = 0; i < N; i++) { res[i] = readCharArray(); } return res; } public final char[] readCharArray() { String[] s = readStrArray(); int cnt = s.length; StringBuilder sb = new StringBuilder(); for (int i = 0; i < cnt; i++) sb.append(s[i]); return sb.toString().toCharArray(); } public final String[] readStrArray() { List<String> res = new ArrayList<String>(); StringTokenizer st = new StringTokenizer(readLine(), " "); while (st.hasMoreTokens()) { res.add(st.nextToken()); } return res.toArray(new String[0]); } public void setDelimiter(String delim) { this.delimiter = delim; } public String getDelimiter() { return this.delimiter; } private String readLine() { try { return br.readLine(); } catch(IOException ioe) { ioe.printStackTrace(); throw new RuntimeException(ioe); } } }
Submission Info
Submission Time | |
---|---|
Task | A - A |
User | tochukaso |
Language | Java (OpenJDK 1.7.0) |
Score | 100 |
Code Size | 5349 Byte |
Status | AC |
Exec Time | 464 ms |
Memory | 20920 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
all | A.txt, B.txt, C.txt, D.txt, E.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
A.txt | AC | 385 ms | 20920 KB |
B.txt | AC | 464 ms | 20704 KB |
C.txt | AC | 435 ms | 20652 KB |
D.txt | AC | 366 ms | 20656 KB |
E.txt | AC | 383 ms | 20740 KB |