結果

問題 No.129 お年玉(2)
コンテスト
ユーザー uwi
提出日時 2015-08-03 23:46:55
言語 Java
(openjdk 23)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 4,024 bytes
コンパイル時間 4,294 ms
コンパイル使用メモリ 89,848 KB
実行使用メモリ 50,432 KB
最終ジャッジ日時 2024-10-12 19:52:34
合計ジャッジ時間 7,703 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 44 WA * 2
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q1xx;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q143XX {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		long n = nl()/1000;
		int m = ni();
		int o = (int)(n%m);
		int e2 = 0, e5 = 0;
		int mod = 1000000000;
		long num = 1;
		int[] rem = new int[m+1];
		{
			for(int i = m-o+1;i <= m;i++)rem[i] = i;
			for(int p = 2;p <= m;p*=2){
				for(int i = (m-o+1+p-1)/p*p;i <= m;i+=p){
					e2++; rem[i] /= 2;
				}
			}
			for(int p = 5;p <= m;p*=5){
				for(int i = (m-o+1+p-1)/p*p;i <= m;i+=p){
					e5++; rem[i] /= 5;
				}
			}
			for(int i = m-o+1;i <= m;i++){
				num = num * rem[i] % mod;
			}
		}
		long den = 1;
		{
			for(int i = 1;i <= o;i++)rem[i] = i;
			for(int p = 2;p <= o;p*=2){
				for(int i = p;i <= o;i+=p){
					e2--; rem[i] /= 2;
				}
			}
			for(int p = 5;p <= o;p*=5){
				for(int i = p;i <= o;i+=p){
					e5--; rem[i] /= 5;
				}
			}
			for(int i = 1;i <= o;i++){
				den = den * rem[i] % mod;
			}
		}
		
		long ret = num * invl(den, mod) % mod;
		for(int i = 1;i <= e2 && i <= 9;i++)ret = ret * 2 % mod;
		for(int i = 1;i <= e5 && i <= 9;i++)ret = ret * 5 % mod;
		out.println(ret);
	}
	
	public static long invl(long a, long mod) {
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		return p < 0 ? p + mod : p;
	}
	
	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 Q143XX().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))){ // when nextLine, (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