dissolve2.cpp

常用算法与数据结构原代码

#include <iostream.h>
#define MAX 100

void main()
{
	int a[MAX],r[MAX];
	int i,n,k;
	cin>>n;
	a[0]=r[0]=n;
	k=1;
	while (1)
	{
		if (r[k-1]==0)
		{
			cout<<a[0]<<"=";
			for (i=1;i<=k-2;i++)
				cout<<a[i]<<"+";
			cout<<a[k-1]<<endl;
			while (k>1 && a[k-1]==1)
				k--;
			if (k==1)
				break;
			a[k-1]--;
			r[k-1]++;
		}
		else
		{
			a[k]=r[k-1]<a[k-1]?r[k-1]:a[k-1];
			r[k]=r[k-1]-a[k];
			k++;
		}
	}
}