結果

問題 No.751 Frac #2
ユーザー holegumaholeguma
提出日時 2019-07-17 21:19:10
言語 Java21
(openjdk 21)
結果
AC  
実行時間 86 ms / 1,000 ms
コード長 3,579 bytes
コンパイル時間 2,337 ms
コンパイル使用メモリ 80,416 KB
実行使用メモリ 54,736 KB
最終ジャッジ日時 2023-08-24 22:17:50
合計ジャッジ時間 6,510 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 68 ms
51,604 KB
testcase_01 AC 74 ms
52,020 KB
testcase_02 AC 71 ms
52,488 KB
testcase_03 AC 72 ms
52,480 KB
testcase_04 AC 67 ms
50,768 KB
testcase_05 AC 69 ms
50,912 KB
testcase_06 AC 69 ms
51,740 KB
testcase_07 AC 70 ms
51,152 KB
testcase_08 AC 72 ms
51,496 KB
testcase_09 AC 69 ms
52,472 KB
testcase_10 AC 81 ms
52,428 KB
testcase_11 AC 73 ms
52,328 KB
testcase_12 AC 82 ms
52,304 KB
testcase_13 AC 73 ms
52,380 KB
testcase_14 AC 69 ms
50,664 KB
testcase_15 AC 70 ms
51,804 KB
testcase_16 AC 70 ms
50,524 KB
testcase_17 AC 82 ms
53,000 KB
testcase_18 AC 68 ms
51,108 KB
testcase_19 AC 69 ms
50,644 KB
testcase_20 AC 72 ms
52,496 KB
testcase_21 AC 69 ms
51,744 KB
testcase_22 AC 66 ms
50,780 KB
testcase_23 AC 68 ms
50,664 KB
testcase_24 AC 69 ms
50,572 KB
testcase_25 AC 81 ms
52,260 KB
testcase_26 AC 82 ms
52,940 KB
testcase_27 AC 68 ms
50,360 KB
testcase_28 AC 80 ms
52,920 KB
testcase_29 AC 82 ms
52,244 KB
testcase_30 AC 86 ms
52,536 KB
testcase_31 AC 68 ms
50,408 KB
testcase_32 AC 71 ms
52,772 KB
testcase_33 AC 68 ms
50,692 KB
testcase_34 AC 72 ms
52,540 KB
testcase_35 AC 73 ms
54,736 KB
testcase_36 AC 67 ms
50,624 KB
testcase_37 AC 72 ms
53,016 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 void solve() {
		int n = ir.nextInt();
		int[] a = ir.nextIntArray(n);
		long p = 1, q = a[0];
		for (int i = 1; i < n; i++) {
			p *= a[i];
		}
		n = ir.nextInt();
		a = ir.nextIntArray(n);
		for (int i = 0; i < n; i++) {
			if (i % 2 == 0) {
				p *= a[i];
			} else {
				q *= a[i];
			}
		}
		int signum = Long.signum(p) * Long.signum(q);
		p = Math.abs(p);
		q = Math.abs(q);
		long g = gcd(p, q);
		p /= g;
		q /= g;
		q *= signum;
		out.println(q + " " + p);
	}

	static long gcd(long a, long b) {
		if (b == 0)
			return a;
		return gcd(b, a % b);
	}

	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) {
		out.println(Arrays.deepToString(o));
	}
}
0