結果

問題 No.1203 お菓子ゲーム
ユーザー uwiuwi
提出日時 2020-08-28 22:56:52
言語 Java21
(openjdk 21)
結果
AC  
実行時間 529 ms / 2,000 ms
コード長 3,911 bytes
コンパイル時間 4,056 ms
コンパイル使用メモリ 84,696 KB
実行使用メモリ 54,676 KB
最終ジャッジ日時 2024-11-14 01:49:43
合計ジャッジ時間 22,776 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 289 ms
53,448 KB
testcase_01 AC 390 ms
53,692 KB
testcase_02 AC 174 ms
53,196 KB
testcase_03 AC 448 ms
53,624 KB
testcase_04 AC 172 ms
53,264 KB
testcase_05 AC 478 ms
53,660 KB
testcase_06 AC 357 ms
53,636 KB
testcase_07 AC 435 ms
54,124 KB
testcase_08 AC 259 ms
53,104 KB
testcase_09 AC 249 ms
53,436 KB
testcase_10 AC 463 ms
53,440 KB
testcase_11 AC 174 ms
53,252 KB
testcase_12 AC 281 ms
53,160 KB
testcase_13 AC 265 ms
53,452 KB
testcase_14 AC 287 ms
53,452 KB
testcase_15 AC 510 ms
54,676 KB
testcase_16 AC 235 ms
53,136 KB
testcase_17 AC 395 ms
54,080 KB
testcase_18 AC 55 ms
50,016 KB
testcase_19 AC 115 ms
52,464 KB
testcase_20 AC 50 ms
50,380 KB
testcase_21 AC 51 ms
50,200 KB
testcase_22 AC 50 ms
50,376 KB
testcase_23 AC 50 ms
50,244 KB
testcase_24 AC 51 ms
50,048 KB
testcase_25 AC 52 ms
50,304 KB
testcase_26 AC 52 ms
50,216 KB
testcase_27 AC 52 ms
50,388 KB
testcase_28 AC 52 ms
50,040 KB
testcase_29 AC 52 ms
50,316 KB
testcase_30 AC 522 ms
53,500 KB
testcase_31 AC 505 ms
53,764 KB
testcase_32 AC 478 ms
54,160 KB
testcase_33 AC 505 ms
53,736 KB
testcase_34 AC 492 ms
54,052 KB
testcase_35 AC 529 ms
53,580 KB
testcase_36 AC 507 ms
54,356 KB
testcase_37 AC 499 ms
54,240 KB
testcase_38 AC 494 ms
54,124 KB
testcase_39 AC 493 ms
53,792 KB
testcase_40 AC 499 ms
53,760 KB
testcase_41 AC 508 ms
53,584 KB
testcase_42 AC 502 ms
53,732 KB
testcase_43 AC 509 ms
53,596 KB
testcase_44 AC 505 ms
53,708 KB
testcase_45 AC 500 ms
53,852 KB
testcase_46 AC 492 ms
53,684 KB
testcase_47 AC 514 ms
53,784 KB
testcase_48 AC 488 ms
53,496 KB
testcase_49 AC 505 ms
53,452 KB
testcase_50 AC 52 ms
50,240 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200828;
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 F2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		for(int T = ni();T > 0;T--)go();
	}
	
	void go()
	{
		// X/Y = [c^2/2] / r / c, r>c
		// c:even, c/2r
		long X = nl(), Y = nl();
		if(2*X > Y){
			X = Y - X;
		}
		
		int ans = 0;
		{
			long C = X*2, R = Y;
			if(R > C){
				ans+=100000000/R;
			}
		}
		// c:odd
		// [(2k+1)^2/2]/r/(2k+1)
		// (2k^2+2k)/r/(2k+1)
		// 2k(k+1)/r/(2k+1)
		for(long d = 1;d*d <= Y;d++){
			if(Y % d == 0){
				if(d % 2 == 1){
					long C = d;
					long k = d/2;
					long num = 2L*k*(k+1);
					if(num % X == 0){
						long R = Y / d * (num / X);
						if(R > C && R <= 100000000){
							ans++;
						}
					}
				}
				if(d*d < Y){
					long e = Y/d;
					if(e % 2 == 1){
						long C = e;
						long k = e/2;
						long num = 2L*k*(k+1);
						if(num % X == 0){
							long R = Y / e * (num / X);
							if(R > C && R <= 100000000){
								ans++;
							}
						}
					}
				}
			}
		}
		out.println(ans);
	}
	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new F2().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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