結果

問題 No.816 Beautiful tuples
ユーザー OlandOland
提出日時 2019-04-20 09:59:17
言語 Java19
(openjdk 21)
結果
AC  
実行時間 54 ms / 1,500 ms
コード長 3,548 bytes
コンパイル時間 2,584 ms
コンパイル使用メモリ 79,684 KB
実行使用メモリ 53,384 KB
最終ジャッジ日時 2023-10-25 23:35:06
合計ジャッジ時間 3,648 ms
ジャッジサーバーID
(参考情報)
judge12 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
53,372 KB
testcase_01 AC 52 ms
53,368 KB
testcase_02 AC 53 ms
53,368 KB
testcase_03 AC 52 ms
51,372 KB
testcase_04 AC 54 ms
53,372 KB
testcase_05 AC 54 ms
53,376 KB
testcase_06 AC 53 ms
53,368 KB
testcase_07 AC 52 ms
53,372 KB
testcase_08 AC 53 ms
53,380 KB
testcase_09 AC 53 ms
53,368 KB
testcase_10 AC 53 ms
53,372 KB
testcase_11 AC 53 ms
53,384 KB
testcase_12 AC 53 ms
53,364 KB
testcase_13 AC 54 ms
53,372 KB
testcase_14 AC 52 ms
52,284 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.*;
import java.util.*;
import java.util.Map.Entry;

public class Main {
	
	//final boolean isDebug = true;
	final boolean isDebug = false;
	String fileName = "input.txt";
	FastScanner sc;
	PrintWriter out;
	final int MOD = (int)1e9+7;
	final int INF = Integer.MAX_VALUE / 2;
	
	void solve() throws Exception{
		int A = sc.nextInt();
		int B = sc.nextInt();
		ArrayList<Long> list = divisor(A+B);
		long min = Long.MAX_VALUE;
		for(long C : list){
			if((A + C) % B == 0 && (B + C) % A == 0 && C != A && C != B){
				System.out.println(C);
				return;
			}
		}
		System.out.println("-1");
		return;
	}
	
	ArrayList<Long> divisor(long n){
		ArrayList<Long> list = new ArrayList<>();
		for(long i = 1; i * i <= n; i++){
			if(n % i == 0){
				list.add(i);
				if(i * i != n) list.add(n / i);
			}
		}
		Collections.sort(list);
		return list;
	}
	
	/* end solve */
	
	/* main */
	public static void main(String[] args) throws Exception {
		new Main().m();
	}
	
	void m() throws Exception {
		long S = System.currentTimeMillis();
		sc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		if(isDebug){
			System.out.println("---Debug---");
			System.out.printf("%8d ms", (G-S));
		}
	}
	/* end main */
}
/* end Main */

class FastScanner {
    private InputStream in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    public FastScanner(InputStream in) {
		this.in = in;
	}
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() {
    	if (hasNextByte()) return buffer[ptr++];
    	else return -1;
    }
    private static boolean isPrintableChar(int c){
    	return 33 <= c && c <= 126;
    }
    public boolean hasNext() {
    	while(hasNextByte() && !isPrintableChar(buffer[ptr]))
    		ptr++; return hasNextByte();
    }
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() {
    	return Double.parseDouble(next());
    }
}
0