結果

問題 No.634 硬貨の枚数1
ユーザー yuya178yuya178
提出日時 2018-01-19 22:15:10
言語 Java21
(openjdk 21)
結果
AC  
実行時間 176 ms / 2,000 ms
コード長 3,895 bytes
コンパイル時間 3,771 ms
コンパイル使用メモリ 79,876 KB
実行使用メモリ 93,324 KB
最終ジャッジ日時 2024-06-07 14:12:16
合計ジャッジ時間 15,343 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 102 ms
92,980 KB
testcase_01 AC 101 ms
93,084 KB
testcase_02 AC 118 ms
93,164 KB
testcase_03 AC 116 ms
93,076 KB
testcase_04 AC 117 ms
93,104 KB
testcase_05 AC 121 ms
93,244 KB
testcase_06 AC 116 ms
93,224 KB
testcase_07 AC 119 ms
93,140 KB
testcase_08 AC 120 ms
93,200 KB
testcase_09 AC 117 ms
93,052 KB
testcase_10 AC 117 ms
93,048 KB
testcase_11 AC 118 ms
93,060 KB
testcase_12 AC 119 ms
92,932 KB
testcase_13 AC 117 ms
93,104 KB
testcase_14 AC 116 ms
93,076 KB
testcase_15 AC 164 ms
93,196 KB
testcase_16 AC 140 ms
93,216 KB
testcase_17 AC 142 ms
93,160 KB
testcase_18 AC 140 ms
92,888 KB
testcase_19 AC 160 ms
93,160 KB
testcase_20 AC 164 ms
93,260 KB
testcase_21 AC 171 ms
93,016 KB
testcase_22 AC 159 ms
93,004 KB
testcase_23 AC 144 ms
92,888 KB
testcase_24 AC 117 ms
93,192 KB
testcase_25 AC 119 ms
93,220 KB
testcase_26 AC 121 ms
93,156 KB
testcase_27 AC 117 ms
92,904 KB
testcase_28 AC 117 ms
92,956 KB
testcase_29 AC 119 ms
92,948 KB
testcase_30 AC 117 ms
93,324 KB
testcase_31 AC 118 ms
93,164 KB
testcase_32 AC 118 ms
93,160 KB
testcase_33 AC 120 ms
93,140 KB
testcase_34 AC 119 ms
92,972 KB
testcase_35 AC 123 ms
93,164 KB
testcase_36 AC 146 ms
93,304 KB
testcase_37 AC 141 ms
93,312 KB
testcase_38 AC 120 ms
93,084 KB
testcase_39 AC 160 ms
93,112 KB
testcase_40 AC 145 ms
93,212 KB
testcase_41 AC 139 ms
93,152 KB
testcase_42 AC 158 ms
93,160 KB
testcase_43 AC 143 ms
93,264 KB
testcase_44 AC 138 ms
93,096 KB
testcase_45 AC 119 ms
93,132 KB
testcase_46 AC 121 ms
93,148 KB
testcase_47 AC 173 ms
92,992 KB
testcase_48 AC 98 ms
93,200 KB
testcase_49 AC 120 ms
93,004 KB
testcase_50 AC 170 ms
93,148 KB
testcase_51 AC 118 ms
93,168 KB
testcase_52 AC 102 ms
92,880 KB
testcase_53 AC 101 ms
92,836 KB
testcase_54 AC 97 ms
93,192 KB
testcase_55 AC 174 ms
92,908 KB
testcase_56 AC 172 ms
93,148 KB
testcase_57 AC 176 ms
93,236 KB
testcase_58 AC 167 ms
92,960 KB
testcase_59 AC 174 ms
93,216 KB
testcase_60 AC 173 ms
93,156 KB
testcase_61 AC 174 ms
93,248 KB
testcase_62 AC 172 ms
93,088 KB
testcase_63 AC 174 ms
93,116 KB
testcase_64 AC 172 ms
93,140 KB
testcase_65 AC 169 ms
92,872 KB
testcase_66 AC 171 ms
93,152 KB
testcase_67 AC 173 ms
93,164 KB
testcase_68 AC 156 ms
93,240 KB
testcase_69 AC 173 ms
92,936 KB
testcase_70 AC 173 ms
92,776 KB
testcase_71 AC 170 ms
93,076 KB
testcase_72 AC 171 ms
93,152 KB
testcase_73 AC 175 ms
93,240 KB
testcase_74 AC 160 ms
93,128 KB
testcase_75 AC 171 ms
93,120 KB
testcase_76 AC 119 ms
92,868 KB
testcase_77 AC 120 ms
92,888 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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[5001];
        boolean[] f = new boolean[20000001];
        for(int i = 1; i <= 5000; i++){
            res[i] = res[i-1] + i;
            f[res[i]] = true;
        }
        boolean[] d = new boolean[20000001];
        for(int i = 1; i <= 5000; i++){
            for(int j = 1; j <= 5000; j++){
                int tmp = res[i]+res[j];
                if(tmp>n) continue;
                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)); }
 
}
0