結果

問題 No.420 mod2漸化式
ユーザー yuya178yuya178
提出日時 2017-11-25 22:31:12
言語 Java21
(openjdk 21)
結果
AC  
実行時間 82 ms / 1,000 ms
コード長 4,264 bytes
コンパイル時間 2,358 ms
コンパイル使用メモリ 95,160 KB
実行使用メモリ 39,772 KB
最終ジャッジ日時 2024-05-05 12:42:46
合計ジャッジ時間 6,123 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 75 ms
39,772 KB
testcase_01 AC 67 ms
38,272 KB
testcase_02 AC 78 ms
39,532 KB
testcase_03 AC 82 ms
38,000 KB
testcase_04 AC 76 ms
38,020 KB
testcase_05 AC 67 ms
37,736 KB
testcase_06 AC 74 ms
38,200 KB
testcase_07 AC 67 ms
38,004 KB
testcase_08 AC 82 ms
39,664 KB
testcase_09 AC 67 ms
37,996 KB
testcase_10 AC 70 ms
37,896 KB
testcase_11 AC 67 ms
37,608 KB
testcase_12 AC 66 ms
38,552 KB
testcase_13 AC 71 ms
38,480 KB
testcase_14 AC 66 ms
38,000 KB
testcase_15 AC 63 ms
38,200 KB
testcase_16 AC 64 ms
37,848 KB
testcase_17 AC 71 ms
38,024 KB
testcase_18 AC 70 ms
38,372 KB
testcase_19 AC 72 ms
37,900 KB
testcase_20 AC 82 ms
39,488 KB
testcase_21 AC 66 ms
38,244 KB
testcase_22 AC 65 ms
37,824 KB
testcase_23 AC 65 ms
37,852 KB
testcase_24 AC 66 ms
38,340 KB
testcase_25 AC 81 ms
39,404 KB
testcase_26 AC 69 ms
38,180 KB
testcase_27 AC 65 ms
37,792 KB
testcase_28 AC 67 ms
39,392 KB
testcase_29 AC 78 ms
38,216 KB
testcase_30 AC 75 ms
38,240 KB
testcase_31 AC 76 ms
38,196 KB
testcase_32 AC 66 ms
38,012 KB
testcase_33 AC 65 ms
38,044 KB
testcase_34 AC 76 ms
37,716 KB
testcase_35 AC 68 ms
37,732 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
    void solve()
    {
        int x = ni();
        long count = 0;
        long sum = 0;
        if(x>31){
            out.println(count+" "+sum);
            return;
        }
        if(x==0){
            count = 1;
            out.println(count+" "+sum);
            return;
        }
        long[][] C = new long[60 + 1][60 + 1];
        for (int i = 0; i <= 60; i++) {
            C[i][0] = 1;
            for (int j = 1; j <= i; j++) {
                C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
            }
        }
        count = C[31][x];
        long t = 0;
        for(int i = 0; i <= 30; i++){
            t += (long)Math.pow(2,i);
        }
        sum = t * C[30][x-1];
        out.println(count+" "+sum);
    }
    
    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)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0