Timus online judge 1014. Product of Digits

Problem link:

A solution in c++

#include<bits/stdc++.h>

using namespace std;

/// Typedef
typedef long long ll;

#define sc1(a) scanf("%lld",&a)
#define sc2(a,b) scanf("%lld %lld",&a,&b)

#define pf1(a) printf("%lld\n",a)
#define pf2(a,b) printf("%lld %lld\n",a,b)

#define mx 1000005
#define mod 10000007


int main()
{
    ll tc,n;
    sc1(n);
    vector<ll>vc;
    if(n == 0) return cout<<"10"<<endl,0;
    if(n == 1) return cout<<"1"<<endl,0;

    for(ll i = 9; i>1; i--){
        while(n % i == 0){
            n /= i;
            vc.push_back(i);
        }
    }
    if(n == 1){
         for(ll i = vc.size()-1; i >= 0; i--){
           cout<<vc[i];
       }
    }
    else cout<<"-1"<<endl;

}