結果

問題 No.129 お年玉(2)
ユーザー t8m8⛄️t8m8⛄️
提出日時 2015-03-12 09:02:34
言語 Java
(openjdk 23)
結果
AC  
実行時間 569 ms / 5,000 ms
コード長 3,861 bytes
コンパイル時間 3,181 ms
コンパイル使用メモリ 79,108 KB
実行使用メモリ 44,352 KB
最終ジャッジ日時 2024-11-27 23:43:26
合計ジャッジ時間 20,061 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 126 ms
43,072 KB
testcase_01 AC 539 ms
44,104 KB
testcase_02 AC 44 ms
37,056 KB
testcase_03 AC 43 ms
37,024 KB
testcase_04 AC 44 ms
36,940 KB
testcase_05 AC 374 ms
44,208 KB
testcase_06 AC 479 ms
44,064 KB
testcase_07 AC 492 ms
44,132 KB
testcase_08 AC 390 ms
44,220 KB
testcase_09 AC 459 ms
44,228 KB
testcase_10 AC 502 ms
44,032 KB
testcase_11 AC 386 ms
44,044 KB
testcase_12 AC 436 ms
44,092 KB
testcase_13 AC 455 ms
44,296 KB
testcase_14 AC 436 ms
44,260 KB
testcase_15 AC 406 ms
44,236 KB
testcase_16 AC 418 ms
44,188 KB
testcase_17 AC 476 ms
44,252 KB
testcase_18 AC 515 ms
44,276 KB
testcase_19 AC 552 ms
43,956 KB
testcase_20 AC 487 ms
44,180 KB
testcase_21 AC 544 ms
44,132 KB
testcase_22 AC 398 ms
44,180 KB
testcase_23 AC 511 ms
44,108 KB
testcase_24 AC 494 ms
44,096 KB
testcase_25 AC 385 ms
44,352 KB
testcase_26 AC 400 ms
44,036 KB
testcase_27 AC 385 ms
44,024 KB
testcase_28 AC 569 ms
43,964 KB
testcase_29 AC 46 ms
37,040 KB
testcase_30 AC 44 ms
36,664 KB
testcase_31 AC 43 ms
36,944 KB
testcase_32 AC 44 ms
36,940 KB
testcase_33 AC 67 ms
38,632 KB
testcase_34 AC 46 ms
37,296 KB
testcase_35 AC 55 ms
37,860 KB
testcase_36 AC 59 ms
38,908 KB
testcase_37 AC 72 ms
39,320 KB
testcase_38 AC 157 ms
43,068 KB
testcase_39 AC 197 ms
43,340 KB
testcase_40 AC 419 ms
43,980 KB
testcase_41 AC 294 ms
44,136 KB
testcase_42 AC 163 ms
43,332 KB
testcase_43 AC 162 ms
43,064 KB
testcase_44 AC 565 ms
44,220 KB
testcase_45 AC 124 ms
43,052 KB
testcase_46 AC 182 ms
43,240 KB
testcase_47 AC 556 ms
43,984 KB
testcase_48 AC 419 ms
44,304 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//No.129 お年玉(2)

import java.util.*;
import java.io.*;
import java.math.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;

public class No129 {

    static final InputStream in = System.in;
    static final PrintWriter out = new PrintWriter(System.out,false);

    static void solve(){
        long n = nextLong();
        int m = nextInt();
        n -= n/1000/m*m*1000;
        n /= 1000;
        out.println(combination(m,n,new BigInteger("1000000000")));
    }

    static BigInteger combination(long n, long r, BigInteger MOD) {
        BigInteger ret = BigInteger.ONE;
        for (int i=1; i<=n; i++) ret = ret.multiply(BigInteger.valueOf(i));
        for (int i=1; i<=n-r; i++) ret = ret.divide(BigInteger.valueOf(i));
        for (int i=1; i<=r; i++) ret = ret.divide(BigInteger.valueOf(i));
        ret = ret.mod(MOD);
        return  ret;
    }

    public static void main(String[] args) throws Exception {
        long start = System.currentTimeMillis();

        solve();
        out.flush();

        long end = System.currentTimeMillis();
        //trace(end-start + "ms");
        in.close();
    }

    static void trace(Object... o) { System.out.println(deepToString(o));}

    static final byte[] buf = new byte[1024];
    static int ptr = 0;
    static int buflen = 0;

    static boolean hasNextByte() {
        if (ptr < buflen)
            return true;
        ptr = 0;
        try{
            buflen = in.read(buf);
        }catch (IOException e) {e.printStackTrace();}
        if (buflen <= 0)
            return false;
        return true;
    }

    static int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}

    static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}

    static void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}

    static boolean hasNext() {skip(); return hasNextByte();}

    static String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    static long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        boolean minus = false;
        long num = readByte();

        if(num == '-'){
            num = 0;
            minus = true;
        }else if (num < '0' || '9' < num){
            throw new NumberFormatException();
        }else{
            num -= '0';
        }
        
        while(true){
            int b = readByte();
            if('0' <= b && b <= '9')
                num = num * 10 + (b - '0');
            else if(b == -1 || !isPrintableChar(b))
                return minus ? -num : num;
            else
                throw new NoSuchElementException();
        }
    }

    static int nextInt() {
        long num = nextLong();
        if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)
            throw new NumberFormatException();
        return (int)num;
    }

    static double nextDouble() {
        return Double.parseDouble(next());
    }

    static char nextChar() {
        if (!hasNext()) throw new NoSuchElementException();
        return (char)readByte();
    }

    static String nextLine() {
        while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++;
        if (!hasNextByte()) throw new NoSuchElementException();

        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (b != '\n' && b != '\r') {
            sb.appendCodePoint(b);
            b = readByte();
        }

        return sb.toString();
    }

    static int[] nextArrayInt(int n) {
        int[] a = new int[n];
        for (int i=0; i<n; i++) a[i] = nextInt();
        return a;
    }
}
0