| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 166225 | 林麒瑞 | 整数幂 | C++ | Wrong Answer | 0 | 2036 MS | 268 KB | 281 | 2024-08-19 10:13:46 |
#include<bits/stdc++.h> using namespace std; int main(){ int a[1000]; int n; double s=1; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; for(int j=1;j<=a[i];j++){ if(pow(2,j)==a[i]){ cout<<"Yes"; s=0; } } if(s==1) cout<<"No"; } return 0; }