| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 54675 | 杨竣周 | 寻找最低数 | C++ | Wrong Answer | 0 | 0 MS | 268 KB | 309 | 2022-07-29 16:46:18 |
#include<bits/stdc++.h> using namespace std; int a(int x){ int _=0; bool bin[10]; while(x){ bin[++_]=x&2; x/=2; } for(int i=1;i<=_;i++){ if(bin[i]) return pow(2,i); } } int main(){ int n; scanf("%d",&n); do{ printf("%d\n",a(n)); scanf("%d",&n); }while(n); return 0; }