UVa993-Product of digits

Product of digits

For a given non-negative integer number N , find the minimal natural Q such that the product of all digits of Q 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 number N (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 <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
int num[10];
int main(){

    int ncase;
    cin >> ncase;
    while(ncase--){
           cin >> n;
           if(n<=1) {
            cout<<n<<endl;
            continue;
           }
           memset(num,0,sizeof num);
           int digit = 9,t = n;
           while(digit>=2){
                while(t%digit==0){
                    num[digit]++;
                    t/=digit;
                }
                digit--;
           }
           if(t>=2) cout<<-1<<endl;
           else{
                //num[1]++;
                for(int i = 2; i <= 9; i++){
                    while(num[i]--){
                        cout<<i;
                    }
                }
                cout<<endl;
           }

    }
    return 0;
}