#297169 (C++14) No.751 Frac #2

• 問題: No.751 Frac #2
• ユーザー: daku9640
• 提出日時: 2018-11-09 22:58:49
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 2,203 bytes
• コンパイル時間: 1,469 ms
• コンパイル使用メモリ: 171,360 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-11-21 06:38:41
• 合計ジャッジ時間: 2,515 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,820 KB
testcase_01	AC	2 ms; 6,816 KB
testcase_02	WA	-
testcase_03	AC	2 ms; 6,816 KB
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	AC	2 ms; 6,816 KB
testcase_09	AC	2 ms; 6,820 KB
testcase_10	WA	-
testcase_11	WA	-
testcase_12	AC	2 ms; 6,816 KB
testcase_13	AC	2 ms; 6,816 KB
testcase_14	WA	-
testcase_15	AC	2 ms; 6,816 KB
testcase_16	AC	2 ms; 6,816 KB
testcase_17	WA	-
testcase_18	AC	2 ms; 6,816 KB
testcase_19	WA	-
testcase_20	WA	-
testcase_21	AC	2 ms; 6,820 KB
testcase_22	WA	-
testcase_23	WA	-
testcase_24	AC	2 ms; 6,820 KB
testcase_25	WA	-
testcase_26	WA	-
testcase_27	AC	2 ms; 6,820 KB
testcase_28	WA	-
testcase_29	AC	2 ms; 6,816 KB
testcase_30	WA	-
testcase_31	AC	2 ms; 6,816 KB
testcase_32	AC	2 ms; 6,820 KB
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	AC	2 ms; 6,820 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define mat(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define each(x,y) for(auto &(x):(y))
#define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); }
#define vec(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
#define bit_count __builtin_popcount
#define mt make_tuple
inline string zero(int a,string s,char c='0'){return string(a-len(s),c)+s;}
inline string zero(int a,int t,char c='0'){return zero(a, to_string(t), c);}
inline string zero(int a,ll t,char c='0'){return zero(a, to_string(t), c);}
#define mini min_element
#define maxi max_element
#define sum accumulate
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << '\n';}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
pii f(ll a, ll b) {
	ll t = __gcd(abs(a), abs(b));
	return mp(a / t, b / t);
}
ll A[20], B[20];
void solve() {
	rep(i, 0, 12) {
		A[i] = B[i] = 1;
	}
	var(int, n1);
	rep(i, 0, n1) cin >> A[i];
	rep(i, 2, n1)
		A[1] *= A[i];
	var(int, n2);
	rep(i, 0, n2) cin >> B[i];
	rrep(i, n2 - 1, 0)
		A[i % 2 == 0] *= B[i];
	A[1] *= B[0];
	tie(A[0], A[1]) = f(A[0], A[1]);
	print(A[0], A[1]);
}
int main() {
	solve();
	return 0;
}