/*
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the  Free Software  Foundation, either  version 3 of the License, or
(at your option) any later version.

This  program  is  distributed  in the hope that  it  will be useful,
but  WITHOUT ANY  WARRANTY; without  even  the  implied  warranty  of
MERCHANTABILITY  or FITNESS  FOR  A  PARTICULAR  PURPOSE. See the GNU
General Public License for more details.

You should  have received  a copy  of the  GNU General Public License
along with this program.  If not, see <http://www.gnu.org/licenses/>.

 Author:         Marco Vitetta
 E-mail:         <vito3200@hotmail.it>
 WebSite:        http://ervito.altervista.org
*/	

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

int chk(char *STRING,int START);
int main()
{
	char concatenation[10],to_concatenate[6];
	int flag,index,multipler=2,multiplicand,number_products=0,products[20],sum_products=0;

	for(;multipler<2000;multipler++)
		for(multiplicand=multipler;multiplicand<2000;multiplicand++)
		{
			sprintf(concatenation,"%i",multipler);
			sprintf(to_concatenate,"%i",multiplicand);
			strcat(concatenation,to_concatenate);
			sprintf(to_concatenate,"%i",multipler*multiplicand);
			strcat(concatenation,to_concatenate);
			if(strlen(concatenation)==9&&chk(concatenation,1))
			{
				for(index=flag=0;index<number_products&&flag==0;index++)
					if(multipler*multiplicand==products[index])
							flag=1;
				if(flag==0)
				{
					products[number_products]=multipler*multiplicand;
					number_products++;
				}
			}
		}
	for(index=0;index<number_products;index++)
		sum_products+=products[index];

	printf("\n\t%i\n\n",sum_products);
	return 0;
}
int chk(char *STRING,int START)				// This function checks if the STRING
{							// contains all number digits between
	int length=0,max_value;				// START and max_value(which  depends
							// by the length of the STRING and it
	for(;STRING[length]!='\0'&&length<11;length++);	// can't be greater than 10)
	max_value=length+START;

	if(length>1 && length<11 && max_value<11 && START>=0 && START<9)
	{
		int array[length],index=0,support;
	
		for(;index<length;index++)
			array[index]=-1;

		for(index=0;index<length;index++)
		{
			support=STRING[index]-48;
			if(support>=START && support<max_value && array[support-START]<0)
				array[support-START]=STRING[index]-48;
			else
				return 0;
		}
		return 1;
	}
	return 0;
}