UVA 993 Product of digits

点击打开链接

Product of digits

For a given non-negative integer number N , find the minimal naturalQ such that the product of all digits ofQ is equal N .

Input

The first line of input contains one positive integer number, which is the number of data sets. Each subsequent line contains one data set which consists of one non-negative integer numberN(0N10⁹) .

Output

For each data set, write one line containing the corresponding natural number Q or `-1' if Q does not exist.

Sample Input

3 
1 
10 
123456789

Sample Output

1 
25 
-1

#include<stdio.h>
int z[100007];
int main()
{
    int t,m,n,a,i;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&m);
        if(m==1)printf("1\n");
        else
        {
             n=9;
            a=0;
            while(n>1)
            {
                if(m%n==0)
                {
                    z[++a]=n;
                    m=m/n;
                }

                else --n;
            }
            if(m!=1)printf("-1");
            else
            for(i=a;i>0;i--)
            printf("%d",z[i]);
            printf("\n");
        }
    }
    return  0;
}