integer_partition.c

用VC实现的简单大数的划分,采用递归算法实现

#include <stdio.h>

int Partition(int n,int m)
{
	if((n<1)||(m<1))
		return 0;
	if(n==1||m==1)
		return 1;
	if(n<m)
		return Partition(n,m-1);
	if(n==m)
		return Partition(n,m-1)+1;
	return Partition(n,m-1)+Partition(n-m,m);
}

main()
{
	int n,m;
	printf("\n\nInput a Integer!\n");
	scanf("%d",&n);
	m=Partition(n,n);
	printf("\nThe number of Partition:\n\n");
	printf("                         m=%d\n\n\n",m);
}