結果

問題 No.751 Frac #2
ユーザー uwiuwi
提出日時 2018-11-09 21:59:13
言語 Java21
(openjdk 21)
結果
AC  
実行時間 91 ms / 1,000 ms
コード長 3,560 bytes
コンパイル時間 3,609 ms
コンパイル使用メモリ 87,688 KB
実行使用メモリ 39,912 KB
最終ジャッジ日時 2024-11-21 05:55:36
合計ジャッジ時間 7,819 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 76 ms
39,568 KB
testcase_01 AC 75 ms
39,872 KB
testcase_02 AC 77 ms
39,808 KB
testcase_03 AC 80 ms
38,396 KB
testcase_04 AC 87 ms
38,112 KB
testcase_05 AC 78 ms
38,372 KB
testcase_06 AC 78 ms
38,224 KB
testcase_07 AC 80 ms
37,868 KB
testcase_08 AC 74 ms
39,748 KB
testcase_09 AC 89 ms
39,524 KB
testcase_10 AC 80 ms
39,612 KB
testcase_11 AC 76 ms
39,524 KB
testcase_12 AC 86 ms
38,764 KB
testcase_13 AC 87 ms
38,156 KB
testcase_14 AC 76 ms
37,856 KB
testcase_15 AC 81 ms
39,560 KB
testcase_16 AC 78 ms
38,488 KB
testcase_17 AC 76 ms
39,364 KB
testcase_18 AC 77 ms
39,008 KB
testcase_19 AC 87 ms
38,216 KB
testcase_20 AC 77 ms
39,804 KB
testcase_21 AC 77 ms
38,484 KB
testcase_22 AC 77 ms
38,400 KB
testcase_23 AC 76 ms
38,236 KB
testcase_24 AC 77 ms
39,892 KB
testcase_25 AC 88 ms
38,612 KB
testcase_26 AC 89 ms
38,320 KB
testcase_27 AC 76 ms
39,796 KB
testcase_28 AC 76 ms
39,728 KB
testcase_29 AC 79 ms
38,116 KB
testcase_30 AC 79 ms
38,108 KB
testcase_31 AC 79 ms
38,240 KB
testcase_32 AC 76 ms
39,912 KB
testcase_33 AC 87 ms
38,748 KB
testcase_34 AC 77 ms
38,312 KB
testcase_35 AC 91 ms
38,736 KB
testcase_36 AC 76 ms
39,524 KB
testcase_37 AC 82 ms
39,644 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest181109;
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 B {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		long num = 1, den = 1;
		for(int i = 0;i < n;i++) {
			int v = ni();
			if(i == 0) {
				num *= v;
			}else {
				den *= v;
			}
		}
		int m = ni();
		for(int i = 0;i < m;i++) {
			int v = ni();
			if(i % 2 == 0) {
				den *= v;
			}else {
				num *= v;
			}
		}
		if(den < 0) {
			num = -num;
			den = -den;
		}
		long g = gcd(Math.abs(num), den);
		num /= g;
		den /= g;
		out.println(num + " " + den);
	}
	
	public static long gcd(long a, long b) {
		while (b > 0) {
			long c = a;
			a = b;
			b = c % b;
		}
		return a;
	}
	
	
	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 B().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