Division UVA - 725

#include <string.h>
#include <stdio.h>
int a[10];
int fun(int x, int y)
{
if(x < 10000)
a[0] ++;
if(y < 10000)
a[0] ++;
int i;
while(x > 0){
a[x % 10] ++;
x /= 10;
}
while(y > 0){
a[y % 10] ++;
y /= 10;
}
for(i = 0; i <= 9; i++){
if(a[i] > 1)
return 0;
}
return 1;
}
int main(void)
{
int n;
int flag = 0;
while(scanf("%d", &n) == 1 && n){
if(!flag)
flag = 1;
else
printf("\n");
int i, num, count = 0;
for(i = 1234; i < 98765; i++){
memset(a, 0, sizeof(a));
num = n * i;
if(num > 98765)
break;
if(fun(num, i)){
printf("%05d / %05d = %d\n", num,  i, n);
count++;
}
}
if(!count)
printf("There are no solutions for %d.\n", n);
}
return 0;
}