結果

問題 No.250 atetubouのzetubou
ユーザー uwiuwi
提出日時 2015-07-24 23:40:41
言語 Java21
(openjdk 21)
結果
AC  
実行時間 122 ms / 5,000 ms
コード長 3,520 bytes
コンパイル時間 4,611 ms
コンパイル使用メモリ 94,648 KB
実行使用メモリ 51,760 KB
最終ジャッジ日時 2024-07-16 00:26:20
合計ジャッジ時間 7,819 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 109 ms
51,424 KB
testcase_01 AC 62 ms
49,716 KB
testcase_02 AC 113 ms
51,328 KB
testcase_03 AC 116 ms
51,508 KB
testcase_04 AC 113 ms
51,724 KB
testcase_05 AC 116 ms
51,512 KB
testcase_06 AC 112 ms
51,504 KB
testcase_07 AC 100 ms
50,948 KB
testcase_08 AC 110 ms
51,632 KB
testcase_09 AC 103 ms
51,404 KB
testcase_10 AC 108 ms
51,420 KB
testcase_11 AC 103 ms
51,760 KB
testcase_12 AC 110 ms
51,276 KB
testcase_13 AC 104 ms
51,668 KB
testcase_14 AC 53 ms
50,188 KB
testcase_15 AC 118 ms
51,708 KB
testcase_16 AC 120 ms
51,624 KB
testcase_17 AC 119 ms
51,672 KB
testcase_18 AC 121 ms
51,696 KB
testcase_19 AC 122 ms
51,680 KB
testcase_20 AC 56 ms
50,200 KB
testcase_21 AC 56 ms
50,196 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

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 Q302 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		double[] lf = new double[4000];
		lf[0] = 0;
		for(int i = 1;i < 4000;i++){
			lf[i] = lf[i-1] + Math.log(i);
		}
		
		for(int Q = ni();Q >= 1;Q--){
			int d = ni(), x = ni();
			long t = nl();
			double y = lf[x+d-1] - lf[d-1] - lf[x];
			if(y > Math.log(1.2E15)){
				out.println("ZETUBOU");
			}else{
				long z = 1;
				long N = x+d-1, R = x;
				if(R > N-R)R = N-R;
				for(int i = 1;i <= R;i++){
					assert z * (N+1-i) % i == 0;
					assert (double)z * (N+1-i) < Long.MAX_VALUE / 2;
					z = z * (N+1-i) / i;
				}
				if(z > t){
					out.println("ZETUBOU");
				}else{
					out.println("AC");
				}
			}
		}
	}
	
	public static long gcd(long a, long b) {
		while (b > 0) {
			long c = a;
			a = b;
			b = c % b;
		}
		return a;
	}
	
	
	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 Q302().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