计蒜客 幂次方

题目链接
https://nanti.jisuanke.com/t/T2103
深搜题

#include<iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
void sol(int a){
	if(a<=4){
		if(a==1)cout<<"2(0)";
		else if(a==2)cout<<"2";
		else if(a==3)cout<<"2+2(0)";
		else if(a==4)cout<<"2(2)";
		return;
	}
	int t=1;
	while(pow(2,t)<=a)++t;
	cout<<"2(";
	sol(t-1);
	cout<<")";
	if(a!=pow(2,t-1)){
		cout<<"+";
	}
	sol(a-pow(2,t-1));
	return;
}
int main(){
	int n;
	cin>>n;
	sol(n);
}