COROANA TE ROG!!!
a)
8
b)
16 31
c)
citeste n
p<-0, i<-1
|-repeta
| m<-i
| |-cat timp m%2=0 executa
| | m<-[m/2]
| |-
| |-daca m=1 atunci
| | p<-i
| |-
| i<i+1
|-pana cand i>n
scrie p
d)
#include<iostream>
using namespace std;
int main(){
int n, p=0, m;
cin>>n;
for(int i=1;i<=n;i++){
m=i;
while(m%2==0)
m/=2;
if(m==1)
p=i;
}
cout<<p;
return 0;
}
