結果
| 問題 | No.1342 Calculation |
| ユーザー |
 t98slider
|
| 提出日時 | 2021-12-18 23:06:31 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 2,000 ms |
| コード長 | 5,748 bytes |
| コンパイル時間 | 1,794 ms |
| コンパイル使用メモリ | 167,216 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-09-15 14:05:14 |
| 合計ジャッジ時間 | 2,063 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
ソースコード
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcountll(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
int msb(ll v){return 63-__builtin_clzll(v);}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}
struct yuri {
ll num,den;
yuri() : num(0),den(1) {}
yuri(ll a) : num(a),den(1){}
yuri(ll a,ll b) : num(a),den(b){safe();}
void safe(){
if(den<0)den*=-1,num*=-1;
ll v=__gcd(abs(num),den);
num/=v,den/=v;
}
yuri& operator++() {num+=den;return *this;}
yuri& operator--() {num-=den;return *this;}
yuri& operator+=(const yuri& rhs) {
num=num*rhs.den+den*rhs.num;
den=den*rhs.den;
safe();
return *this;
}
yuri& operator-=(const yuri& rhs) {
num=num*rhs.den-den*rhs.num;
den=den*rhs.den;
safe();
return *this;
}
yuri& operator*=(const yuri& rhs) {
num=num*rhs.num;
den=den*rhs.den;
safe();
return *this;
}
yuri& operator/=(const yuri& rhs) {
num=num*rhs.den;
den=den*rhs.num;
safe();
return *this ;
}
yuri operator+() const { return *this; }
yuri operator-() const { return yuri() - *this; }
friend yuri operator+(const yuri& lhs, const yuri& rhs) {
return yuri(lhs) += rhs;
}
friend yuri operator-(const yuri& lhs, const yuri& rhs) {
return yuri(lhs) -= rhs;
}
friend yuri operator*(const yuri& lhs, const yuri& rhs) {
return yuri(lhs) *= rhs;
}
friend yuri operator/(const yuri& lhs, const yuri& rhs) {
return yuri(lhs) /= rhs;
}
friend bool operator==(const yuri& lhs, const yuri& rhs) {
return (lhs.num==rhs.num&&lhs.den==rhs.den);
}
friend bool operator!=(const yuri& lhs, const yuri& rhs) {
return (lhs.num!=rhs.num||lhs.den!=rhs.den);
}
friend bool operator<(const yuri& lhs, const yuri& rhs) {
return (lhs.num*rhs.den<lhs.den*rhs.num);
}
friend bool operator<=(const yuri& lhs, const yuri& rhs) {
return (lhs.num*rhs.den<=lhs.den*rhs.num);
}
friend bool operator>(const yuri& lhs, const yuri& rhs) {
return (lhs.num*rhs.den>lhs.den*rhs.num);
}
friend bool operator>=(const yuri& lhs, const yuri& rhs) {
return (lhs.num*rhs.den>=lhs.den*rhs.num);
}
friend ostream& operator << (ostream &os, const yuri& rhs) noexcept {
if(rhs.den==1)return os << rhs.num;
return os << rhs.num << '/' << rhs.den;
}
};
int main(){
out(((yuri(19,47)+yuri(28,43))/27).num);
}