結果

問題 No.129 お年玉(2)
ユーザー threepipes_sthreepipes_s
提出日時 2015-01-17 00:00:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 847 ms / 5,000 ms
コード長 3,670 bytes
コンパイル時間 2,560 ms
コンパイル使用メモリ 76,160 KB
実行使用メモリ 53,324 KB
最終ジャッジ日時 2023-08-18 16:28:27
合計ジャッジ時間 24,229 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 102 ms
52,972 KB
testcase_01 AC 847 ms
53,016 KB
testcase_02 AC 47 ms
49,804 KB
testcase_03 AC 47 ms
49,152 KB
testcase_04 AC 47 ms
49,336 KB
testcase_05 AC 374 ms
53,132 KB
testcase_06 AC 562 ms
53,000 KB
testcase_07 AC 681 ms
52,964 KB
testcase_08 AC 475 ms
52,940 KB
testcase_09 AC 609 ms
53,120 KB
testcase_10 AC 694 ms
53,192 KB
testcase_11 AC 453 ms
52,920 KB
testcase_12 AC 574 ms
52,804 KB
testcase_13 AC 610 ms
53,076 KB
testcase_14 AC 593 ms
52,820 KB
testcase_15 AC 483 ms
53,316 KB
testcase_16 AC 569 ms
52,904 KB
testcase_17 AC 664 ms
52,896 KB
testcase_18 AC 637 ms
53,324 KB
testcase_19 AC 684 ms
53,144 KB
testcase_20 AC 676 ms
52,956 KB
testcase_21 AC 810 ms
52,796 KB
testcase_22 AC 476 ms
52,956 KB
testcase_23 AC 730 ms
52,968 KB
testcase_24 AC 691 ms
52,976 KB
testcase_25 AC 462 ms
53,136 KB
testcase_26 AC 476 ms
53,056 KB
testcase_27 AC 461 ms
52,756 KB
testcase_28 AC 830 ms
53,132 KB
testcase_29 AC 47 ms
49,296 KB
testcase_30 AC 48 ms
49,428 KB
testcase_31 AC 48 ms
49,356 KB
testcase_32 AC 47 ms
49,512 KB
testcase_33 AC 63 ms
52,956 KB
testcase_34 AC 53 ms
49,360 KB
testcase_35 AC 61 ms
52,876 KB
testcase_36 AC 62 ms
53,012 KB
testcase_37 AC 65 ms
52,948 KB
testcase_38 AC 144 ms
52,868 KB
testcase_39 AC 198 ms
53,052 KB
testcase_40 AC 448 ms
52,812 KB
testcase_41 AC 292 ms
50,904 KB
testcase_42 AC 156 ms
52,904 KB
testcase_43 AC 159 ms
52,960 KB
testcase_44 AC 819 ms
53,032 KB
testcase_45 AC 112 ms
52,924 KB
testcase_46 AC 206 ms
52,932 KB
testcase_47 AC 804 ms
53,032 KB
testcase_48 AC 500 ms
52,932 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.BitSet;
import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.TreeSet;
public class Main {
	public static void main(String[] args) throws NumberFormatException, IOException{
		ContestScanner in = new ContestScanner();
		long n = in.nextLong();
		long m = in.nextLong();
//		long div = n/m;
		long ans1 = (n/m/1000)*1000;
		long res = n-ans1*m;
//		long mod = n%m;
		int atari = (int)(res/1000);
		int hazure = (int)(m-atari);
		int a = atari>hazure?atari:hazure;
		int b = atari>hazure?hazure:atari;
		System.out.println(combi((int)m+1, b, 1000000000));
	}
	
	public static long combi(int n, int a, int mod){
		long[] old = new long[n];
		long[] tri = new long[n];
		for(int i=0; i<n; i++){
			tri = new long[n];
			for(int j=0; j<i+1; j++){
				if(j == 0 || j == i){
					tri[j] = 1;
				}else{
					tri[j] = (old[j-1] + old[j])%mod;
				}
			}
			old = tri;
		}
		return tri[a];
	}
}

class MyComp implements Comparator<int[]>{
	public int compare(int[] a, int[] b) {
		return a[0] - b[0];
	}
}
//
//class Reverse implements Comparator<Integer>{
//	public int compare(Integer arg0, Integer arg1) {
//		return arg1 - arg0;
//	}
//}

class Node implements Comparable<Node>{
	int id;
	int qNum;
	int xor;
	List<Node> edge = new ArrayList<Node>();
	public Node(int id, int q, int xor){
		this.id = id;
		qNum = q;
		this.xor = xor;
	}
	public void createEdge(Node node){
		edge.add(node);
	}
	
	@Override
	public int compareTo(Node n) {
		return n.qNum - qNum;
	}
}


class MyMath{
	public final static double PIhalf = Math.PI/2.0;
	public static double pAngle(double x, double y){
		// ベクトル(1, 0)と(x, y)とのなす角を返す(rad:0 to 2pi)
		if(x == 0){
			if(y == 0){
				System.err.println("pAngle error: zero vector.");
				return 0;
			}else if(y < 0){
				return PIhalf*3.0;
			}else{
				return PIhalf;
			}
		}
		double rad = Math.atan(y/x);
		if(rad < 0){
			rad += Math.PI*2.0;
		}
		return rad;
	}
	public static long fact(long n){
		long res = 1;
		while(n > 0){
			res *= n--;
		}
		return res;
	}
	public static long[][] pascalT(int n){
		long[][] tri = new long[n][];
		for(int i=0; i<n; i++){
			tri[i] = new long[i+1];
			for(int j=0; j<i+1; j++){
				if(j == 0 || j == i){
					tri[i][j] = 1;
				}else{
					tri[i][j] = tri[i-1][j-1] + tri[i-1][j];
				}
			}
		}
		return tri;
	}

	// 最大公約数
	static int gcd(int a, int b){
		return b == 0 ? a : gcd(b, a % b);
	}

	// 最小公倍数
	static int lcm(int a, int b){
		return a * b / gcd(a, b);
	}
}

class ContestScanner{
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException{
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));
	}
	
	public String nextToken() throws IOException{
		if(line == null || line.length <= idx){
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	public long nextLong() throws IOException, NumberFormatException{
		return Long.parseLong(nextToken());
	}
	public int nextInt() throws NumberFormatException, IOException{
		return (int)nextLong();
	}
	public double nextDouble() throws NumberFormatException, IOException{
		return Double.parseDouble(nextToken());
	}
}
0