結果

問題 No.2954 Calculation of Exponentiation
ユーザー Taiki0715
提出日時 2024-11-08 22:31:17
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 5,153 bytes
コンパイル時間 6,051 ms
コンパイル使用メモリ 310,352 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-08 22:31:26
合計ジャッジ時間 6,696 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<int(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<(x)<<'\n',static_cast<void>(0)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
else return init;
}
#ifdef LOCAL
#include<debug.h>
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
void SOLVE();
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout<<fixed<<setprecision(16);
#ifdef LOCAL
clock_t start=clock();
#endif
int testcase=1;
//cin>>testcase;
for(int i=0;i<testcase;i++){
SOLVE();
}
#ifdef LOCAL
cerr<<"time:";
cerr<<(clock()-start)/1000;
cerr<<"ms\n";
#endif
}
template<typename T>
struct fraction{
T num,den;
void simple(){
T g=gcd(num,den);
this->num/=g;
this->den/=g;
}
fraction():num(0),den(1){}
fraction(T a):num(a),den(1){}
fraction(T a,T b):num(a),den(b){
this->simple();
if(this->den<0)this->num*=-1,this->den*=-1;
}
static fraction raw(T a,T b){
fraction ret;
ret.num=a;
ret.den=b;
return ret;
}
friend fraction operator+(const fraction &a){return a;}
friend fraction operator-(const fraction &a){return fraction::raw(-a.num,a.den);}
friend fraction operator+(const fraction &a,const fraction &b){
return fraction(a.num*b.den+b.num*a.den,a.den*b.den);
}
friend fraction operator-(const fraction &a,const fraction &b){
return fraction(a.num*b.den-b.num*a.den,a.den*b.den);
}
friend fraction operator*(const fraction &a,const fraction &b){
fraction c(a.num,b.den),d(b.num,a.den);
c.num*=d.num;
c.den*=d.den;
return c;
}
friend fraction operator/(const fraction &a,const fraction &b){
fraction c(a.num,b.num),d(b.den,a.den);
c.num*=d.num;
c.den*=d.den;
if(c.den<0){
c.num*=-1;
c.den*=-1;
}
return c;
}
friend bool operator==(const fraction &a,const fraction &b){
return a.num==b.num&&a.den==b.den;
}
friend bool operator!=(const fraction &a,const fraction &b){
return !(a==b);
}
friend bool operator<(const fraction &a,const fraction &b){
return a.num*b.den<b.num*a.den;
}
friend bool operator>(const fraction &a,const fraction &b){
return a.num*b.den>b.num*a.den;
}
friend bool operator<=(const fraction &a,const fraction &b){
return !(a>b);
}
friend bool operator>=(const fraction &a,const fraction &b){
return !(a<b);
}
fraction &operator=(const fraction &a)=default;
fraction &operator+=(const fraction &a){return *this=*this+a;}
fraction &operator-=(const fraction &a){return *this=*this-a;}
fraction &operator*=(const fraction &a){return *this=*this*a;}
fraction &operator/=(const fraction &a){return *this=*this/a;}
inline fraction inv() const{
if(this->num>=0)return fraction::raw(this->den,this->num);
else return fraction::raw(-this->den,-this->num);
}
friend ostream &operator<<(ostream &os,const fraction &a){
os<<a.num<<' '<<a.den;
return os;
}
};
template<typename T>
fraction<T>abs(fraction<T>x){
return x>=0?x:-x;
}
void SOLVE(){
fraction<ll>a,b;
auto input=[]()->fraction<ll> {
string s;
cin>>s;
s.erase(s.begin()+s.find('.'));
return fraction<ll>(stoll(s),10000);
};
a=input(),b=input();
if(b==0)fin("Yes");
if(b<0){
a=a.inv();
b=-b;
}
if(a.den!=1)fin("No");
if(b.den==1)fin("Yes");
if(b.den>20)fin("No");
debug(a,b);
//assume a is integer,1<den(b)<=20
ll ai=a.num;
ll bi=b.num,bj=b.den;
debug(bj);
auto powi=[](ll a,ll b)->ll {
assert(a<=1e9);
ll res=1;
while(b--){
res*=a;
if(res>1e9)return 1e18;
}
return res;
};
ll root_a=[&](){
ll ok=0,ng=ai+1;
while(ng-ok>1){
ll mid=(ok+ng)/2;
(powi(mid,bj)<=ai?ok:ng)=mid;
}
return ok;
}();
cout<<(powi(root_a,bj)==a?"Yes":"No")<<endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0