結果
問題 | No.1218 Something Like a Theorem |
ユーザー |
|
提出日時 | 2020-11-23 08:13:50 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 4,240 bytes |
コンパイル時間 | 1,807 ms |
コンパイル使用メモリ | 167,504 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-23 17:20:45 |
合計ジャッジ時間 | 2,690 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 16 |
ソースコード
#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 vector1d(type,name,...) vector<type>name(__VA_ARGS__)#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__)))#define umap unordered_map#define uset unordered_setusing namespace std;using ll = long long;const int MOD=1000000007;const int MOD2=998244353;const int INF=1<<30;const ll INF2=(ll)1<<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> 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 updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}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;}//osa_k法に基づく素因数分解/*struct osa_k{int n;vector<int> osak_calc;osa_k(int n = 1000001) {osak_calc.resize(n, -1);for(int i=2;i<n;i++){if(osak_calc[i]==-1){for(int j=i;j<n;j+=i){if(osak_calc[j]==-1)osak_calc[j]=i;}}}}vector<pair<int,int>> prime_factor(int x){vector<pair<int,int>> ret;if(x<=1)return ret;ret.push_back(make_pair(osak_calc[x],1));x/=osak_calc[x];while(osak_calc[x]!=-1){if(osak_calc[x]==ret[ret.size()-1].first){ret[ret.size()-1].second++;}else{ret.push_back(make_pair(osak_calc[x],1));}x/=osak_calc[x];}return ret;}};*/int main(){LL(n,z);ll d=intpow(z,n),xe,ye;for(ll x=1;1;x++){xe=intpow(x,n);if(xe>=d)break;for(ll y=1;1;y++){ye=intpow(y,n);if(xe+ye==d){out("Yes");return 0;}else if(xe+ye>=d){break;}}}out("No");}