結果
問題 | No.1218 Something Like a Theorem |
ユーザー |
![]() |
提出日時 | 2020-09-04 21:25:49 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 2,424 bytes |
コンパイル時間 | 2,395 ms |
コンパイル使用メモリ | 210,840 KB |
最終ジャッジ日時 | 2025-01-14 04:58:32 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 16 |
ソースコード
#pragma GCC optimize ("Ofast")#include<bits/stdc++.h>using namespace std;inline int my_getchar_unlocked(){static char buf[1048576];static int s = 1048576;static int e = 1048576;if(s == e && e == 1048576){e = fread_unlocked(buf, 1, 1048576, stdin);s = 0;}if(s == e){return EOF;}return buf[s++];}inline void rd(int &x){int k;int m=0;x=0;for(;;){k = my_getchar_unlocked();if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){x=k-'0';break;}}for(;;){k = my_getchar_unlocked();if(k<'0'||k>'9'){break;}x=x*10+k-'0';}if(m){x=-x;}}struct MY_WRITER{char buf[1048576];int s;int e;MY_WRITER(){s = 0;e = 1048576;}~MY_WRITER(){if(s){fwrite_unlocked(buf, 1, s, stdout);}}};MY_WRITER MY_WRITER_VAR;void my_putchar_unlocked(int a){if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);MY_WRITER_VAR.s = 0;}MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;}inline void wt_L(char a){my_putchar_unlocked(a);}inline void wt_L(const char c[]){int i=0;for(i=0;c[i]!='\0';i++){my_putchar_unlocked(c[i]);}}template<class T, class S> inline T pow_L(T a, S b){T res = 1;res = 1;for(;;){if(b&1){res *= a;}b >>= 1;if(b==0){break;}a *= a;}return res;}inline double pow_L(double a, double b){return pow(a,b);}int N;int Z;int main(){int x;int y;int t;int s;rd(N);rd(Z);(Z = pow_L(Z,N));for(x=1;;x++){if(N > 20 && x > 1){break;}t =(pow_L(x,N));if(t > Z){break;}for(y=x;;y++){if(N > 20 && y > 1){break;}s = t +(pow_L(y,N));if(s > Z){break;}if(s == Z){wt_L("Yes");wt_L('\n');return 0;}}}wt_L("No");wt_L('\n');return 0;}// cLay varsion 20200813-1 [beta]// --- original code ---// int N, Z;// {// int x, y, t, s;// rd(N,Z);// Z **= N;// for(x=1;;x++){// if(N > 20 && x > 1) break;// t = x ** N;// if(t > Z) break;// for(y=x;;y++){// if(N > 20 && y > 1) break;// s = t + y ** N;// if(s > Z) break;// if(s == Z) wt("Yes"), return 0;// }// }// wt("No");// }