結果

問題 No.1342 Calculation
コンテスト
ユーザー FF256grhy
提出日時 2021-01-20 17:20:10
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 6,420 bytes
コンパイル時間 1,822 ms
コンパイル使用メモリ 194,640 KB
最終ジャッジ日時 2025-01-18 02:53:50
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 1
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); i++)
#define incIX(i, l, r) for(LL i = (l)    ; i <  (r); i++)
#define incXI(i, l, r) for(LL i = (l) + 1; i <= (r); i++)
#define incXX(i, l, r) for(LL i = (l) + 1; i <  (r); i++)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); i--)
#define decIX(i, l, r) for(LL i = (r) - 1; i >= (l); i--)
#define decXI(i, l, r) for(LL i = (r)    ; i >  (l); i--)
#define decXX(i, l, r) for(LL i = (r) - 1; i >  (l); i--)
#define inc(i, n)  incIX(i, 0, n)
#define dec(i, n)  decIX(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
auto inII = [](auto x, auto l, auto r) { return (l <= x && x <= r); };
auto inIX = [](auto x, auto l, auto r) { return (l <= x && x <  r); };
auto inXI = [](auto x, auto l, auto r) { return (l <  x && x <= r); };
auto inXX = [](auto x, auto l, auto r) { return (l <  x && x <  r); };
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define RV(c) reverse(ALL(c))
#define SC static_cast
#define SI(c) SC<int>(c.size())
#define SL(c) SC<LL >(c.size())
#define RF(e, c) for(auto & e: c)
#define SF(c, ...) for(auto & [__VA_ARGS__]: c)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
auto * IS = & cin;
auto * OS = & cout;
array<string, 3> SEQ = { "", " ", "" };
// input
template<typename T> T in() { T a; (* IS) >> a; return a; }
// input: tuple
template<int I, typename U> void tin_(istream & is, U & t) {
	if constexpr(I < tuple_size<U>::value) { is >> get<I>(t); tin_<I + 1>(is, t); }
}
template<typename ... T> istream & operator>>(istream & is, tuple<T ...> & t) { tin_<0>(is, t); return is; }
template<typename ... T> auto tin() { return in<tuple<T ...>>(); }
// input: array
template<typename T, size_t N> istream & operator>>(istream & is, array<T, N> & a) { RF(e, a) { is >> e; } return is; }
template<typename T, size_t N> auto ain() { return in<array<T, N>>(); }
// input: multi-dimensional vector
template<typename T> T vin() { T v; (* IS) >> v; return v; }
template<typename T, typename N, typename ... M> auto vin(N n, M ... m) {
	vector<decltype(vin<T, M ...>(m ...))> v(n); inc(i, n) { v[i] = vin<T, M ...>(m ...); } return v;
}
// input: multi-column (tuple<vector>)
template<typename U, int I> void colin_([[maybe_unused]] U & t) { }
template<typename U, int I, typename A, typename ... B> void colin_(U & t) {
	get<I>(t).PB(in<A>()); colin_<U, I + 1, B ...>(t);
}
template<typename ... T> auto colin(int n) {
	tuple<vector<T> ...> t; inc(i, n) { colin_<tuple<vector<T> ...>, 0, T ...>(t); } return t;
}
// output
void out_([[maybe_unused]] string s) { }
template<typename A> void out_([[maybe_unused]] string s, A && a) { (* OS) << a; }
template<typename A, typename ... B> void out_(string s, A && a, B && ... b) { (* OS) << a << s; out_(s, b ...); }
auto outF = [](auto x, auto y, auto z, auto ... a) { (* OS) << x; out_(y, a ...); (* OS) << z << flush; };
auto out  = [](auto ... a) { outF("", " " , "\n", a ...); };
auto outS = [](auto ... a) { outF("", " " , " " , a ...); };
auto outL = [](auto ... a) { outF("", "\n", "\n", a ...); };
auto outN = [](auto ... a) { outF("", ""  , ""  , a ...); };
// output: multi-dimensional vector
template<typename T> ostream & operator<<(ostream & os, vector<T> const & v) {
	os << SEQ[0]; inc(i, SI(v)) { os << (i == 0 ? "" : SEQ[1]) << v[i]; } return (os << SEQ[2]);
}
template<typename T> void vout_(T && v) { (* OS) << v; }
template<typename T, typename A, typename ... B> void vout_(T && v, A a, B ... b) {
	inc(i, SI(v)) { (* OS) << (i == 0 ? "" : a); vout_(v[i], b ...); }
}
template<typename T, typename A, typename ... B> void vout (T && v, A a, B ... b) { vout_(v, a, b ...); (* OS) << a << flush; }
template<typename T, typename A, typename ... B> void voutN(T && v, A a, B ... b) { vout_(v, a, b ...); (* OS)      << flush; }

// ---- ----

struct Frac {
	LL a, b;
	Frac(LL aa = 0, LL bb = 1) {
		a = aa; b = bb;
		if(b < 0) { a *= -1; b *= -1; }
		LL d = gcd(abs(a), b);
		a /= d; b /= d;
	}
	Frac exp(LL y) {
		Frac p = 1, e = (* this);
		if(y < 0) { e = 1 / e; y = -y; }
		while(y) { if(y & 1) { p *= e; } e *= e; y >>= 1; }
		return p;
	}
	friend bool   operator< (Frac   x, Frac y) { return (x.a * y.b <  y.a * x.b); }
	friend bool   operator> (Frac   x, Frac y) { return (x.a * y.b >  y.a * x.b); }
	friend bool   operator<=(Frac   x, Frac y) { return (x.a * y.b <= y.a * x.b); }
	friend bool   operator>=(Frac   x, Frac y) { return (x.a * y.b >= y.a * x.b); }
	friend bool   operator==(Frac   x, Frac y) { return (x.a * y.b == y.a * x.b); }
	friend bool   operator!=(Frac   x, Frac y) { return (x.a * y.b != y.a * x.b); }
	friend Frac   operator+ (Frac   x        ) { return Frac(+x.a, x.b); }
	friend Frac   operator- (Frac   x        ) { return Frac(-x.a, x.b); }
	friend Frac   operator+ (Frac   x, Frac y) { return Frac(x.a * y.b + y.a * x.b, x.b * y.b); }
	friend Frac   operator- (Frac   x, Frac y) { return Frac(x.a * y.b - y.a * x.b, x.b * y.b); }
	friend Frac   operator* (Frac   x, Frac y) { return Frac(x.a * y.a, x.b * y.b); }
	friend Frac   operator/ (Frac   x, Frac y) { return Frac(x.a * y.b, x.b * y.a); }
	friend Frac   operator^ (Frac   x, LL   y) { return x.exp(y); }
	friend Frac & operator+=(Frac & x, Frac y) { return (x = x + y); }
	friend Frac & operator-=(Frac & x, Frac y) { return (x = x - y); }
	friend Frac & operator*=(Frac & x, Frac y) { return (x = x * y); }
	friend Frac & operator/=(Frac & x, Frac y) { return (x = x / y); }
	friend Frac & operator^=(Frac & x, LL   y) { return (x = x ^ y); }
	friend istream & operator>>(istream & is, Frac & x) { x.b = 1; return (is >> x.a); }
	friend ostream & operator<<(ostream & os, Frac   x) { return (x.b == 1 ? os << x.a : os << x.a << "/" << x.b); }
};

// ----

int main() {
	out((Frac(19, 47) + Frac(28, 43)) * Frac(2021, 27));
}
0