結果
問題 | No.153 石の山 |
ユーザー | uwi |
提出日時 | 2015-02-15 23:37:46 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 70 ms / 5,000 ms |
コード長 | 3,556 bytes |
コンパイル時間 | 4,405 ms |
コンパイル使用メモリ | 80,368 KB |
実行使用メモリ | 51,112 KB |
最終ジャッジ日時 | 2023-08-04 17:05:36 |
合計ジャッジ時間 | 7,477 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
50,704 KB |
testcase_01 | AC | 64 ms
50,544 KB |
testcase_02 | AC | 65 ms
50,612 KB |
testcase_03 | AC | 63 ms
50,716 KB |
testcase_04 | AC | 62 ms
50,624 KB |
testcase_05 | AC | 62 ms
50,704 KB |
testcase_06 | AC | 64 ms
50,448 KB |
testcase_07 | AC | 63 ms
50,488 KB |
testcase_08 | AC | 62 ms
50,688 KB |
testcase_09 | AC | 61 ms
50,552 KB |
testcase_10 | AC | 62 ms
50,904 KB |
testcase_11 | AC | 64 ms
50,784 KB |
testcase_12 | AC | 62 ms
50,496 KB |
testcase_13 | AC | 62 ms
50,944 KB |
testcase_14 | AC | 70 ms
50,476 KB |
testcase_15 | AC | 63 ms
50,808 KB |
testcase_16 | AC | 62 ms
50,604 KB |
testcase_17 | AC | 64 ms
50,684 KB |
testcase_18 | AC | 63 ms
50,560 KB |
testcase_19 | AC | 63 ms
48,580 KB |
testcase_20 | AC | 63 ms
50,688 KB |
testcase_21 | AC | 62 ms
51,112 KB |
testcase_22 | AC | 69 ms
50,476 KB |
testcase_23 | AC | 63 ms
50,700 KB |
testcase_24 | AC | 63 ms
50,668 KB |
testcase_25 | AC | 63 ms
50,684 KB |
testcase_26 | AC | 64 ms
50,684 KB |
testcase_27 | AC | 63 ms
50,624 KB |
testcase_28 | AC | 64 ms
50,672 KB |
testcase_29 | AC | 64 ms
50,728 KB |
testcase_30 | AC | 64 ms
50,928 KB |
ソースコード
package q1xx; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Q13 { static InputStream is; static PrintWriter out; static String INPUT = ""; static void solve() { int n = ni(); int[] win = new int[n+1]; for(int i = 2;i <= n;i++){ int two = win[i/2]^win[i-i/2]; int three = win[i/3]^win[(i+1)/3]^win[(i+2)/3]; for(int j = 0;j < 3;j++){ if(j != two && j != three){ win[i] = j; break; } } } out.println(win[n] != 0 ? "A" : "B"); } public static void main(String[] args) throws Exception { long S = System.currentTimeMillis(); is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); tr(G-S+"ms"); } private static boolean eof() { if(lenbuf == -1)return true; int lptr = ptrbuf; while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false; try { is.mark(1000); while(true){ int b = is.read(); if(b == -1){ is.reset(); return true; }else if(!isSpaceChar(b)){ is.reset(); return false; } } } catch (IOException e) { return true; } } private static byte[] inbuf = new byte[1024]; static int lenbuf = 0, ptrbuf = 0; private static int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private static double nd() { return Double.parseDouble(ns()); } private static char nc() { return (char)skip(); } private static String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private static char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private static char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } 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 int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); } }