玄学 MLE

#include<iostream>
#include<stdio.h>
using namespace std;
int n,i;
int a[500000];
void work(int n,int i)
{
	if (n==1) cout<<"2(0)"; 
	if (n==2) cout<<"2";
	if (n==3) cout<<"2+2(0)";
	if (n>=1 && n<=3) return ;
	cout<<2;
	if (n!=0) 
	{
		while (a[i]>n) i--;
		n-=a[i];
		//cout<<">>"<<i<<endl;
		cout<<"(";
		work(i,i);
		cout<<")";
	} else return ;
	if (n!=0) 
	{
		cout<<"+";
		work(n,i);
	}
}
int main()
{
	cin>>n;
	a[0]=1;
	int i=0;
	while (a[i]<=n) a[++i]=a[i-1]*2;
	if (n==0) cout<<0<<endl; else work(n,i);
}