解二的幂次方

#include <bits/stdc++.h>

using namespace std;

void p(int x){

int a[14],k=0,i=0,cnt=0;

while(x!=0){

int m=x%2;

if(m==1){

a[cnt]=k;

cnt++;

}

x/=2;

k++;

}

for (i=cnt-1;i>=0;i--){

if(a[i]==0)

cout<<"2(0)";

else if (a[i]==1)

cout<<"2";

else if(a[i]==2)

cout<<"2(2)";

else{

cout<<"2(";

p(a[i]);

cout<<")";

}

if(i!=0)

cout<<"+";

}

}

int main(){

int n;

cin>>n;

p(n);

return 0;

}