結果

問題 No.148 試験監督（3）
ユーザー uwiuwi
提出日時 2015-02-12 17:49:07
言語 Java21
(openjdk 21)
結果
AC  
実行時間 699 ms / 1,000 ms
コード長 4,923 bytes
コンパイル時間 4,315 ms
コンパイル使用メモリ 80,752 KB
実行使用メモリ 60,308 KB
最終ジャッジ日時 2024-06-23 19:08:40
合計ジャッジ時間 9,811 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 217 ms
52,492 KB
testcase_01 AC 267 ms
52,368 KB
testcase_02 AC 492 ms
52,284 KB
testcase_03 AC 555 ms
52,036 KB
testcase_04 AC 699 ms
52,544 KB
testcase_05 AC 452 ms
52,120 KB
testcase_06 AC 475 ms
57,612 KB
testcase_07 AC 692 ms
60,288 KB
testcase_08 AC 604 ms
60,308 KB
testcase_09 AC 144 ms
54,588 KB
testcase_10 AC 142 ms
54,360 KB
testcase_11 AC 76 ms
51,028 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q3xx;
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 Q371_4F {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static final int INTERVAL = 3400000;
	
	static int d(char[] a,int l){int r=0,j=l+4;for(;j>=l;j--)r=r*93+a[j]-(a[j]+1880)/58;return r;}
	static final char[] enigma = "!    CLc!-|k$k-d{e$#OZL0 @x7?$`e4/&1j50)i?(C,'?jW-<0FN'#*7}$5sMq HFc%#ZWcR!9ZM^'c{u|'5.ev*['x]&S^>Z'dhrT%1{-k%2KLX gZ=E-Np6e u*O.({>=H&U3#T'`'Fa!.J=2*^M2O-vQ+]-VT.,&!2($&4kSc$T#^y#PB}j*]r-l*]DSa$M 'W*4/2<&r[;*)ii|n(c'BS*RBRj(E/Q~*o]8--3)>X)VRm=&Fo39)CaTt *<S6)Lrg5 !L&I*w;8A*0QX%)(9A&.|Gkv- =h7)VJTx)aDqJ(>^/h(TC%(';3iS)4|of'+XSB'QK.%+>O4}*@@ Q-#>b#&-`PS!dhn@'E e)-f>GA Lrlo-VEw6#c|G1$gOrx%@O;s NF2>%$8I:)=)jz*Eus<-!WtU!_vvC$K-*}- (u>!6^]K%S;H{*7wa+.E.T8,9kR=*yh6K #|^/,^Q54+=u5K$?DRO#GRE!) Sn]%CR'+%wJ6-%^o{u%)o2L%Bw&;+o<fD,`O],&(h%q&juPO'T>fo&2D0h&:D&D*&<u,*lFw*#tNo& AJNq(t@:K,b_)|+}.Yn+CJT_(4(V(''C<.,HxS% Sj5y*TKPD$`{tw$F(tB+W@9`-zC^_*h=4v'Dk#_-9Zn7.G+6U!:<os&nin;(tR<~-=pCv*YW@1%Cpff  u,/+P~/Z)};u` z8^y-mWHS-( L7+hp`D'X+8a%-0l.-{ {f$^_JK#%ub6+y.[=!%6Y_(E5~w+3DPu-<#rO)H)=h }01X$=}mN%k[{'-jhxy';#{N#2XI^&j$.^+qYs0+w2}:&o&Xk-D^Fy%[/yx&>a_u)!V^ %x'X&+PU17$+**t(R?lT#Y<dz!6%0[$a}P$#*sdV,s<-|'`a]!(Y,c^ Hsp< Rb4+$UW+x*=ty#$_y1V$l5P%+4:AH(PD+a(D-UG 02h?$eT@O!v:)T(^,B{&H|PL+!i'p!xY/|%7 Rr)K&7$(KTUv'lrb*),|~c){Nx>-3+Cb ,h*p,6 .[ pZYP%J>Qn,`%'Q&ubw%$QV%',7tJi!:U5$+QZB9!?/Na%)%Sk#_G G !VF~!$yya)#=b{,-]vR,IX0R-~tUH,z@jK,VLO>!9y;s&>y ?'./PR+Buxe)lf6l+/4Em+(`AW'^$2t!^Y%c&ry3d,DyZc,puBB)8Q>z yzI['*^` ,OTf6(m*cj,E}{r'-KS;#@zt|,w#Zm!Z;9I#1h[F!#(*@$mf7A)e96!,dvk#'7tpV$-1Eu)dW&G%tk~T)H0xD**wMc-([@%&bRM%'|6Aw+tM{8)SR_0+<o-q+/&&Z-PETJ'paqL,jhH|+p.U[)1&vc,Wyk0$_=6g#Nydk)Wduo q'<b(=}z^ *O{% dxdr#[ffc-WOB;!w/OL*d5=@!Us4g%mCrl 3p**&+hTx-)QH%%<NfY%K*U0&u*#8+[pk ,8dhh#s-q6)l,[2#fH~t(".toCharArray();
	static void solve()
	{
		for(int T = ni();T >= 1;T--){
			String C = ns(), P = ns();
			if(P.length() >= 11){
				out.println(0);
				continue;
			}
			long pl = Long.parseLong(P);
			
			if(pl >= mod){
				out.println(0);
				continue;
			}
			
			long cl = 0;
			if(C.length() >= 12){
				for(char x : C.toCharArray())cl = (cl*10+x-'0')%mod;
			}else{
				cl = Long.parseLong(C);
				if(cl-(2*pl-1)+1 <= 0){
					out.println(0);
					continue;
				}
			}
			
			long sup = (cl-(pl-1))%mod;
			long inf = (cl-(2*pl-1))%mod;
			if(inf < 0)inf += mod;
			if(sup < 0)sup += mod;
			if(sup < inf){
				out.println(0);
				continue;
			}
			
			out.println(f((int)sup)*invl(f((int)inf), mod)%mod);
		}
	}
	
	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;
	}
	
	static long f(int n)
	{
		int h = n%INTERVAL;
		if(h < INTERVAL/2){
			long mul = d(enigma, n/INTERVAL*5);
			int base = n/INTERVAL*INTERVAL;
			for(int i = base+1;i <= n;i++){
				mul = mul * i % mod;
			}
			return mul;
		}else{
			long mul = 1;
			int base = n/INTERVAL*INTERVAL+INTERVAL;
			for(int i = base;i > n;i--){
				mul = mul * i % mod;
			}
			return invl(mul,mod)*d(enigma, n/INTERVAL*5+5)%mod;
		}
	}
	
	static int mod = 1000000007;
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static 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 static 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 static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0