結果

問題 No.816 Beautiful tuples
ユーザー holegumaholeguma
提出日時 2019-07-17 13:09:57
言語 Java21
(openjdk 21)
結果
AC  
実行時間 52 ms / 1,500 ms
コード長 3,494 bytes
コンパイル時間 2,277 ms
コンパイル使用メモリ 78,080 KB
実行使用メモリ 50,360 KB
最終ジャッジ日時 2024-12-21 08:53:03
合計ジャッジ時間 3,682 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
50,184 KB
testcase_01 AC 51 ms
50,248 KB
testcase_02 AC 52 ms
50,272 KB
testcase_03 AC 52 ms
50,256 KB
testcase_04 AC 51 ms
50,272 KB
testcase_05 AC 51 ms
50,360 KB
testcase_06 AC 51 ms
50,264 KB
testcase_07 AC 49 ms
49,772 KB
testcase_08 AC 49 ms
50,116 KB
testcase_09 AC 49 ms
50,176 KB
testcase_10 AC 49 ms
50,040 KB
testcase_11 AC 50 ms
50,248 KB
testcase_12 AC 52 ms
50,276 KB
testcase_13 AC 49 ms
50,220 KB
testcase_14 AC 50 ms
50,252 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;
	static boolean debug = false;

	static void solve() {
		long a = ir.nextLong();
		long b = ir.nextLong();
		long d = a + b;
		long mi = Long.MAX_VALUE;
		for (int i = 1; i <= Math.sqrt(d); i++) {
			if (d % i == 0) {
				if (a != i && b != i && (a + i) % b == 0 && (b + i) % a == 0)
					mi = i;
				long j = d / i;
				if (a != j && b != j && (a + j) % b == 0 && (b + j) % a == 0)
					mi = Math.min(mi, j);
			}
		}
		out.println(mi == Long.MAX_VALUE ? -1 : mi);
	}

	public static void main(String[] args) {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}

	static void tr(Object... o) {
		if (debug)
			out.println(Arrays.deepToString(o));
	}
}
0