結果

問題 No.751 Frac #2
ユーザー tutuztutuz
提出日時 2018-11-09 22:18:11
言語 Java19
(openjdk 19.0.1)
結果
AC  
実行時間 95 ms / 1,000 ms
コード長 3,994 bytes
コンパイル時間 1,940 ms
実行使用メモリ 37,732 KB
最終ジャッジ日時 2022-12-26 20:13:26
合計ジャッジ時間 7,129 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 92 ms
37,428 KB
testcase_01 AC 91 ms
37,672 KB
testcase_02 AC 94 ms
37,640 KB
testcase_03 AC 90 ms
37,532 KB
testcase_04 AC 94 ms
37,568 KB
testcase_05 AC 91 ms
37,384 KB
testcase_06 AC 90 ms
37,492 KB
testcase_07 AC 90 ms
37,652 KB
testcase_08 AC 92 ms
37,652 KB
testcase_09 AC 92 ms
37,444 KB
testcase_10 AC 94 ms
37,452 KB
testcase_11 AC 91 ms
37,420 KB
testcase_12 AC 92 ms
37,584 KB
testcase_13 AC 95 ms
37,544 KB
testcase_14 AC 90 ms
37,488 KB
testcase_15 AC 92 ms
37,516 KB
testcase_16 AC 92 ms
37,480 KB
testcase_17 AC 92 ms
37,568 KB
testcase_18 AC 91 ms
37,444 KB
testcase_19 AC 94 ms
37,552 KB
testcase_20 AC 93 ms
37,492 KB
testcase_21 AC 94 ms
37,516 KB
testcase_22 AC 91 ms
37,352 KB
testcase_23 AC 90 ms
37,464 KB
testcase_24 AC 90 ms
37,480 KB
testcase_25 AC 92 ms
37,488 KB
testcase_26 AC 93 ms
37,460 KB
testcase_27 AC 91 ms
37,672 KB
testcase_28 AC 91 ms
37,536 KB
testcase_29 AC 95 ms
37,592 KB
testcase_30 AC 89 ms
37,536 KB
testcase_31 AC 94 ms
37,548 KB
testcase_32 AC 92 ms
37,524 KB
testcase_33 AC 90 ms
37,308 KB
testcase_34 AC 92 ms
37,592 KB
testcase_35 AC 93 ms
37,512 KB
testcase_36 AC 90 ms
37,732 KB
testcase_37 AC 90 ms
37,480 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import static java.lang.Math.*;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int n = in.nextInt();
			long[] a = in.nextLongArray(n);

			int m = in.nextInt();
			long[] b = in.nextLongArray(m);

			int count = 0;
			for (long l : a) {
				if (l < 0) count++;
			}
			for (long l : b) {
				if (l < 0) count++;
			}

			P bunsi = new P(1, 1), bunbo = new P(1, 1);
			for (int i = 0; i < n; i++) {
				if (i == 0) {
					bunsi.bunsi *= abs(a[i]);
				} else {
					bunsi.bunbo *= abs(a[i]);
				}
			}

			if (m == 1) {
				bunbo.bunsi = abs(b[0]);
			} else if (m == 2) {
				bunbo.bunsi = abs(b[0]);
				bunbo.bunbo = abs(b[1]);
			} else {
				for (int i = m-1; i >= 2; i--) {
					b[i-2] *= abs(b[i]);
				}

				bunbo.bunsi = abs(b[0]);
				bunbo.bunbo = abs(b[1]);
			}

			long si = bunsi.bunsi * bunbo.bunbo;
			long bo = bunsi.bunbo * bunbo.bunsi;

			long g = gcd(si, bo);

			out.printf("%d %d\n", si / g * (count % 2 == 1 ? -1 : 1), bo / g);
		}
	}

	public static long gcd(long a, long b) {
		return (b == 0) ? a : gcd(b, a % b);
	}

	static class P {
		long bunsi, bunbo;

		public P(long bunsi, long bunbo) {
			super();
			this.bunsi = bunsi;
			this.bunbo = bunbo;
		}

		@Override
		public String toString() {
			return "P [bunsi=" + bunsi + ", bunbo=" + bunbo + "]";
		}

	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

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

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

		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}

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

		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

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

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}
	}

}
0