結果

問題 No.751 Frac #2
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-11-11 03:30:07
言語 Java19
(openjdk 21)
結果
WA  
実行時間 -
コード長 2,984 bytes
コンパイル時間 2,405 ms
コンパイル使用メモリ 83,168 KB
実行使用メモリ 53,288 KB
最終ジャッジ日時 2023-08-18 06:44:31
合計ジャッジ時間 7,330 ms
ジャッジサーバーID
(参考情報)
judge12 / judge13
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 88 ms
52,796 KB
testcase_01 AC 88 ms
52,820 KB
testcase_02 AC 89 ms
52,844 KB
testcase_03 AC 87 ms
52,796 KB
testcase_04 WA -
testcase_05 AC 88 ms
52,812 KB
testcase_06 AC 89 ms
52,812 KB
testcase_07 WA -
testcase_08 AC 89 ms
53,036 KB
testcase_09 WA -
testcase_10 AC 88 ms
52,924 KB
testcase_11 AC 91 ms
52,732 KB
testcase_12 AC 88 ms
52,732 KB
testcase_13 AC 87 ms
50,752 KB
testcase_14 AC 89 ms
52,948 KB
testcase_15 AC 90 ms
52,740 KB
testcase_16 AC 89 ms
52,720 KB
testcase_17 AC 90 ms
52,796 KB
testcase_18 AC 89 ms
50,844 KB
testcase_19 WA -
testcase_20 AC 90 ms
52,756 KB
testcase_21 AC 89 ms
51,076 KB
testcase_22 AC 88 ms
52,808 KB
testcase_23 AC 88 ms
53,252 KB
testcase_24 AC 90 ms
52,848 KB
testcase_25 AC 90 ms
52,732 KB
testcase_26 AC 90 ms
52,808 KB
testcase_27 AC 90 ms
52,752 KB
testcase_28 AC 91 ms
52,812 KB
testcase_29 AC 89 ms
52,972 KB
testcase_30 AC 90 ms
52,812 KB
testcase_31 AC 90 ms
52,720 KB
testcase_32 AC 90 ms
52,716 KB
testcase_33 AC 90 ms
52,820 KB
testcase_34 AC 90 ms
52,800 KB
testcase_35 AC 89 ms
52,852 KB
testcase_36 AC 89 ms
52,804 KB
testcase_37 AC 90 ms
53,288 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

public class Main {


  private static void solve() {
    int n = ni();
    long[] a = nal(n);
    int m = ni();
    long[] b = nal(m);
    
    long x = 1;
    for (int i = 1; i < n; i ++) {
      x *= a[i];
    }

    for (int i = m - 1; i >= 2; i --) {
      b[i - 2] *= b[i];
    }
    x *= b[0];
    long y = a[0] * b[1];
    
    long g = gcd(Math.abs(x), Math.abs(y));
    x /= g;
    y /= g;
    
    if (x < 0) {
      x = -x;
      y = -y;
    }
    System.out.println(y + " " + x);
  }
  
  
  public static long gcd(long a, long b) {
    while (b > 0){
        long c = a;
        a = b;
        b = c % b;
    }
    return a;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0