P1010 幂次方

#include<bits/stdc++.h> 
using namespace std;
int _find(int y){
	for(int i=0;i<=15;i++){
		if(pow(2,i)<=y){
			continue;
		}else{
			return i-1;
		}
	}
}
void dfs(int x){
	if(x==0) return;
	int t=_find(x);
	if(t==1) cout<<"2";
	if(t==0) cout<<"2(0)";
	if(t>1){
		cout<<"2(";
		dfs(t);
		cout<<")";
	}
	if((x-pow(2,t))!=0){
		cout<<"+";
		dfs((x-pow(2,t)));
	}
}
int main()
{
	int n;cin>>n;
	dfs(n);
	return 0;
}