// *Partition Of Number* idea by K. M¹czyńska,
// polished & cached by K. Bosak 1998-03-11
// kbosak@box43.pl


// http://panoramix.ift.uni.wroc.pl/~bosy


#include <iostream.h>

long dynarray[121*121]={0};

long partition(char x, char y)
{
	long *target=dynarray+x+121*y;
	if(*target)
	    return *target;
	x-=y;
	if(x<0)
	{
		y+=x;
		x=0;
	}
	long result=1;
	while(y>1)
	{
		result+=partition(x, y);
		x++;
		y--;
	}
	return *target=result;
}

int main()
{
	for(char x=1; x<121; x++)
		cout<<static_cast<int>(x)<<"\t"<<partition(x, x)<<endl;
	return 0;
}