結果

問題 No.751 Frac #2
コンテスト
ユーザー penguinshunya
提出日時 2019-07-13 12:11:13
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,241 bytes
コンパイル時間 2,151 ms
コンパイル使用メモリ 197,372 KB
最終ジャッジ日時 2025-01-07 06:43:46
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1 WA * 1
other AC * 7 WA * 29
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define repp(i, n) rep(i, n)
#define reppp(i, n) repp(i, n)
#define rrepp(i, n) rrep(i, n)
#define repss(i, n) reps(i, n)
#define repcc(i, n) repc(i, n)
#define repii(i, a, b) repi(i, a, b)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }

void solve() {
  int A; cin >> A;
  vi64 a(A); cin >> a;
  int B; cin >> B;
  vi64 b(B); cin >> b;

  i64 a1, a2;
  for (int i = 0; i + 3 <= A; i++) {
    a[i + 2] = a[i + 1] * a[i + 2];
    a[i + 1] = a[i];
  }
  if (A == 1) {
    a1 = 1, a2 = a[0];
  } else if (A == 2) {
    a1 = a[0], a2 = a[1];
  } else {
    a1 = a[A - 1], a2 = a[A - 2];
  }
  
  reverse(all(b));
  i64 b1, b2;
  for (int i = 0; i + 3 <= B; i++) {
    b[i + 2] = b[i + 2] * b[i];
    b[i + 1] = b[i];
  }
  if (B == 1) {
    b1 = 1, b2 = b[0];
  } else if (B == 2) {
    b1 = b[0], b2 = b[1];
  } else {
    b1 = b[B - 2], b2 = b[B - 1];
  }

  a2 *= b1, b2 *= a1;
  
  i64 m = gcd(abs(a2), abs(b2));
  a2 /= m, b2 /= m;
  if (b2 < 0) b2 *= -1, a2 *= -1;
  cout << a2 << " " << b2 << '\n';
}
0