UVA 725 - Division

#include <iostream>
using namespace std;
#include <string.h>
#include <stdio.h>
#include <queue>
#include <algorithm>
int a[10];
int sum( int x, int y )
{
if( y > 98765 ) return 0;
memset(a,0,sizeof(a));
if(x<10000)
a[0]=1;
while( x )
{
a[x%10]++;
x/=10;
}
while(y)
{
a[y%10]++;
y/=10;
}
for( int i = 0; i < 10; i ++ )
{
if(a[i]>1) return 0;
if(a[i]==0) return 0;
}
return 1;
}
int main()
{
int n,ans=0;
while( scanf ( "%d", &n ) != EOF )
{
if( n == 0 ) break;
if(ans++) printf("\n");
int  f = 1;
for( int i = 1234; i < 100000; i ++ )
if( sum( i, i*n ) )
{
f=0;
printf("%05d / %05d = %d\n",i*n,i,n);
}
if( f ) printf("There are no solutions for %d.\n",n);
}
return 0;
}