http://cxsjsxmooc.openjudge.cn/2018t2fallsum/004/
提示:当然可以递归写,但是还要思考多麻烦
观察:这数据范围这么善良你猜是干嘛的
启示:打表可真爽
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int power[15]={1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384};//0~14
char s[20][30]={
"2(0)","2","2(2)","2(2+2(0))","2(2(2))","2(2(2)+2(0))","2(2(2)+2)","2(2(2)+2+2(0))",
"2(2(2+2(0)))","2(2(2+2(0))+2(0))","2(2(2+2(0))+2)","2(2(2+2(0))+2+2(0))","2(2(2(2+2(0)))+2(2(2)))",
"2(2(2(2+2(0)))+2(2(2))+2(0))","2(2(2+2(0))+2(2)+2)"
};//0~14
//0 1 2 3 4 5 6 7
//8 9 10 11 12
//13 14
int label[20];
int nums;
int add;
void output(int i)
{
printf("%s",s[i]);
}
void search(int num)
{
if(num!=nums&&num!=0) printf("+");
int i;
for(i=14;i>=0;i--)
{
int now=num-power[i];
if(now>=0)
{
output(i);
search(now);
break;
}
}
}
int main()
{
scanf("%d",&nums);
search(nums);
return 0;
}