#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int main()
{
	int *ar,i,ITERATIONS,j,k,PENTAGONALS,res;

	ITERATIONS=26753;		// Maximun number of cycles.
					// It has been chosen considering that
					// the sum of 2 pentagonals has not to
					// exceed the integer representability

	PENTAGONALS=37837;		// Maximun number of calculable values
					// in the integer representability.

	ar=malloc(PENTAGONALS*4);
	for(i=0;i++<PENTAGONALS;)
		ar[i-1]=i*(3*i-1)/2;

	for(i=0;i<ITERATIONS;i++)
	{
		for(j=i;j<ITERATIONS;)
		{
			res=ar[i]+ar[++j];
			for(k=j;++k<PENTAGONALS&&res>ar[k];);
			if(res==ar[k])
			{
				res=abs(ar[j]-ar[i]);
				for(k=0;++k<PENTAGONALS&&res>ar[k];);
				if(res==ar[k])
					printf("%i-%i=%i\n",ar[j],ar[i],res);
			}
		}
	}
return 0;
}