結果

問題 No.1200 お菓子配り-3
ユーザー uwiuwi
提出日時 2020-08-28 21:30:22
言語 Java21
(openjdk 21)
結果
AC  
実行時間 3,567 ms / 4,000 ms
コード長 3,712 bytes
コンパイル時間 7,604 ms
コンパイル使用メモリ 79,756 KB
実行使用メモリ 53,784 KB
最終ジャッジ日時 2023-08-13 05:40:35
合計ジャッジ時間 34,847 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,156 KB
testcase_01 AC 43 ms
49,572 KB
testcase_02 AC 52 ms
49,572 KB
testcase_03 AC 50 ms
49,160 KB
testcase_04 AC 51 ms
49,432 KB
testcase_05 AC 51 ms
49,520 KB
testcase_06 AC 51 ms
49,376 KB
testcase_07 AC 95 ms
52,372 KB
testcase_08 AC 96 ms
51,884 KB
testcase_09 AC 94 ms
51,776 KB
testcase_10 AC 94 ms
51,892 KB
testcase_11 AC 96 ms
52,524 KB
testcase_12 AC 292 ms
52,484 KB
testcase_13 AC 294 ms
52,056 KB
testcase_14 AC 296 ms
52,456 KB
testcase_15 AC 292 ms
52,616 KB
testcase_16 AC 296 ms
52,408 KB
testcase_17 AC 846 ms
52,684 KB
testcase_18 AC 1,170 ms
52,740 KB
testcase_19 AC 332 ms
52,536 KB
testcase_20 AC 2,185 ms
53,328 KB
testcase_21 AC 2,184 ms
53,220 KB
testcase_22 AC 2,571 ms
53,336 KB
testcase_23 AC 2,171 ms
53,784 KB
testcase_24 AC 2,201 ms
53,364 KB
testcase_25 AC 2,195 ms
53,464 KB
testcase_26 AC 2,178 ms
53,444 KB
testcase_27 AC 42 ms
49,296 KB
testcase_28 AC 3,567 ms
52,796 KB
testcase_29 AC 2,643 ms
53,316 KB
testcase_30 AC 2,633 ms
53,024 KB
testcase_31 AC 43 ms
49,508 KB
testcase_32 AC 42 ms
49,396 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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		// AB+C=X
		// AC+B=Y
		for(int T = ni();T > 0;T--)go();
	}
	
	void go()
	{
		long X = nl(), Y = nl();
		// A(B-C)+(C-B) = X-Y
		// A(B+C)+(C+B) = X+Y
		long Z = X+Y;
		int ans = 0;
		for(long d = 1;d*d <= Z;d++){
			if(Z % d == 0){
				ans += test(d, X, Y);
				if(d*d < Z){
					ans += test(Z/d, X, Y);
				}
			}
		}
		out.println(ans);
	}
	
	// (A+1)(B+C)=X+Y
	// (A-1)(B-C) = X-Y
	long test(long d, long X, long Y)
	{
		long A = d - 1;
		long BC = (X+Y)/d;
		if(A <= 0)return 0L;
		if(A == 1){
			return X == Y ? X-1 : 0;
		}
		long BmC = (X-Y)/(A-1);
		long B = (BC + BmC) / 2;
		long C = (BC - BmC) / 2;
		if(B <= 0 || C <= 0)return 0;
		if(A*B+C == X && A*C+B == Y)return 1;
		return 0;
	}
	
	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 C().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