結果
問題 | No.634 硬貨の枚数1 |
ユーザー | yuya178 |
提出日時 | 2018-01-19 22:05:06 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,775 bytes |
コンパイル時間 | 3,961 ms |
コンパイル使用メモリ | 77,324 KB |
実行使用メモリ | 51,164 KB |
最終ジャッジ日時 | 2023-08-26 18:36:21 |
合計ジャッジ時間 | 9,259 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 38 ms
49,456 KB |
testcase_01 | AC | 37 ms
49,192 KB |
testcase_02 | AC | 37 ms
49,012 KB |
testcase_03 | AC | 37 ms
49,192 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | AC | 37 ms
48,972 KB |
testcase_12 | AC | 36 ms
49,128 KB |
testcase_13 | AC | 37 ms
49,256 KB |
testcase_14 | AC | 36 ms
49,196 KB |
testcase_15 | AC | 36 ms
49,184 KB |
testcase_16 | AC | 38 ms
49,264 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 38 ms
49,144 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 37 ms
48,972 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 40 ms
49,192 KB |
testcase_26 | AC | 37 ms
49,152 KB |
testcase_27 | AC | 38 ms
47,232 KB |
testcase_28 | AC | 38 ms
49,320 KB |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 37 ms
49,036 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 41 ms
49,152 KB |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | AC | 38 ms
49,324 KB |
testcase_40 | WA | - |
testcase_41 | AC | 41 ms
49,324 KB |
testcase_42 | WA | - |
testcase_43 | AC | 39 ms
49,128 KB |
testcase_44 | AC | 40 ms
49,192 KB |
testcase_45 | WA | - |
testcase_46 | AC | 37 ms
49,132 KB |
testcase_47 | WA | - |
testcase_48 | AC | 36 ms
49,248 KB |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | AC | 36 ms
49,128 KB |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
testcase_57 | AC | 40 ms
48,968 KB |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | AC | 41 ms
49,000 KB |
testcase_63 | WA | - |
testcase_64 | AC | 43 ms
49,000 KB |
testcase_65 | WA | - |
testcase_66 | WA | - |
testcase_67 | AC | 41 ms
49,164 KB |
testcase_68 | WA | - |
testcase_69 | WA | - |
testcase_70 | AC | 39 ms
49,188 KB |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | WA | - |
testcase_74 | WA | - |
testcase_75 | AC | 42 ms
49,128 KB |
testcase_76 | WA | - |
testcase_77 | AC | 39 ms
49,328 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(); long[] res = new long[10001]; for(int i = 1; i <= 10000; i++){ res[i] = res[i-1] + i; } int r = 0; for(int i = 1; i <= 10000; i++){ if(n==res[i]){ out.println(1); return; } if(n<res[i]){ r = i-1; break; } } long p = n - res[r]; out.println(p%2==1 ? 2 : 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)); } }