| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 55613 | 汪天一 | 寻找最低数 | C++ | Accepted | 100 | 0 MS | 264 KB | 395 | 2022-07-30 16:41:09 |
#include<bits/stdc++.h> using namespace std; int bin[32]={0},a; int main(){ while(1){ cin>>a; if(a==0) break; int i=0; while(a>0){ bin[i]=a%2; a/=2; i++; } for(int j=0;j<i;j++){ if(bin[j]!=0){ cout<<(int)pow(2,j)<<endl; break; } } } return 0; }