結果
問題 | No.634 硬貨の枚数1 |
ユーザー | yuya178 |
提出日時 | 2018-01-19 22:12:16 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,859 bytes |
コンパイル時間 | 3,169 ms |
コンパイル使用メモリ | 78,516 KB |
実行使用メモリ | 74,696 KB |
最終ジャッジ日時 | 2023-08-26 18:38:32 |
合計ジャッジ時間 | 12,152 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 79 ms
73,072 KB |
testcase_01 | AC | 80 ms
72,496 KB |
testcase_02 | AC | 79 ms
72,664 KB |
testcase_03 | AC | 78 ms
73,068 KB |
testcase_04 | AC | 79 ms
72,732 KB |
testcase_05 | AC | 79 ms
72,736 KB |
testcase_06 | AC | 80 ms
72,788 KB |
testcase_07 | AC | 80 ms
72,788 KB |
testcase_08 | AC | 78 ms
72,764 KB |
testcase_09 | AC | 78 ms
73,136 KB |
testcase_10 | AC | 78 ms
73,112 KB |
testcase_11 | AC | 79 ms
72,504 KB |
testcase_12 | AC | 79 ms
72,596 KB |
testcase_13 | AC | 78 ms
72,648 KB |
testcase_14 | AC | 79 ms
72,672 KB |
testcase_15 | AC | 79 ms
72,608 KB |
testcase_16 | AC | 79 ms
72,624 KB |
testcase_17 | AC | 79 ms
72,492 KB |
testcase_18 | AC | 79 ms
72,588 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 79 ms
72,608 KB |
testcase_22 | AC | 81 ms
72,816 KB |
testcase_23 | AC | 79 ms
73,040 KB |
testcase_24 | AC | 84 ms
73,584 KB |
testcase_25 | AC | 79 ms
74,588 KB |
testcase_26 | AC | 80 ms
72,612 KB |
testcase_27 | AC | 78 ms
73,056 KB |
testcase_28 | AC | 78 ms
72,748 KB |
testcase_29 | AC | 78 ms
72,560 KB |
testcase_30 | AC | 80 ms
72,880 KB |
testcase_31 | AC | 79 ms
72,680 KB |
testcase_32 | AC | 78 ms
72,600 KB |
testcase_33 | AC | 81 ms
73,044 KB |
testcase_34 | AC | 79 ms
72,488 KB |
testcase_35 | AC | 79 ms
73,076 KB |
testcase_36 | AC | 79 ms
72,668 KB |
testcase_37 | AC | 77 ms
72,484 KB |
testcase_38 | AC | 82 ms
73,056 KB |
testcase_39 | AC | 83 ms
73,060 KB |
testcase_40 | AC | 79 ms
73,072 KB |
testcase_41 | AC | 82 ms
73,036 KB |
testcase_42 | AC | 83 ms
73,064 KB |
testcase_43 | AC | 79 ms
73,124 KB |
testcase_44 | AC | 79 ms
72,516 KB |
testcase_45 | AC | 83 ms
73,412 KB |
testcase_46 | AC | 79 ms
72,756 KB |
testcase_47 | WA | - |
testcase_48 | AC | 80 ms
72,560 KB |
testcase_49 | AC | 79 ms
72,516 KB |
testcase_50 | AC | 82 ms
73,016 KB |
testcase_51 | AC | 78 ms
72,664 KB |
testcase_52 | AC | 79 ms
72,756 KB |
testcase_53 | AC | 78 ms
72,624 KB |
testcase_54 | AC | 78 ms
72,652 KB |
testcase_55 | AC | 79 ms
72,608 KB |
testcase_56 | AC | 79 ms
72,700 KB |
testcase_57 | AC | 79 ms
73,024 KB |
testcase_58 | AC | 79 ms
73,140 KB |
testcase_59 | AC | 79 ms
72,668 KB |
testcase_60 | AC | 82 ms
73,168 KB |
testcase_61 | AC | 79 ms
73,076 KB |
testcase_62 | AC | 79 ms
72,528 KB |
testcase_63 | AC | 79 ms
72,692 KB |
testcase_64 | AC | 79 ms
72,736 KB |
testcase_65 | AC | 79 ms
72,484 KB |
testcase_66 | AC | 79 ms
73,040 KB |
testcase_67 | AC | 78 ms
72,668 KB |
testcase_68 | AC | 78 ms
72,496 KB |
testcase_69 | AC | 78 ms
73,080 KB |
testcase_70 | AC | 79 ms
72,724 KB |
testcase_71 | AC | 78 ms
72,464 KB |
testcase_72 | AC | 82 ms
73,552 KB |
testcase_73 | AC | 79 ms
72,520 KB |
testcase_74 | AC | 78 ms
72,492 KB |
testcase_75 | AC | 80 ms
72,892 KB |
testcase_76 | AC | 79 ms
73,076 KB |
testcase_77 | AC | 81 ms
73,260 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; // import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long MOD = 1_000_000_007; long inf = Long.MAX_VALUE; void solve(){ int n = ni(); int[] res = new int[2001]; boolean[] f = new boolean[10000001]; for(int i = 1; i <= 2000; i++){ res[i] = res[i-1] + i; f[res[i]] = true; } boolean[] d = new boolean[10000001]; for(int i = 1; i <= 2000; i++){ for(int j = 1; j <= 2000; j++){ int tmp = res[i]+res[j]; d[tmp] = true; } } if(f[n]) out.println(1); else if(d[n]) out.println(2); else out.println(3); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Main().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private 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 boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b) && b != ' ')){ sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private 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 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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private 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 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) { System.out.println(Arrays.deepToString(o)); } }