797A - k-Factorization - CodeForces Solution

#include <bits/stdc++.h>
#define ll long long

using namespace std;

int main()
{
   
       ll n,k;
       cin>>n>>k;
      
       vector<ll>ans;
       ll temp = n;
       ll prod = 1;
       for(int i=2;i<=temp;i++)
       {
           while(n%i==0 and k>1)
           {
               ans.push_back(i);
               k--;
               n/=i;
               prod*=i;
               //cout<<1<<endl;
           }
       }
       //cout<<prod<<" "<<ans.size()<<endl;
   
       if(temp%prod==0 and temp/prod!=1)
       {
            for(int i=0;i<ans.size();i++)
           {
               cout<<ans[i]<<" ";
               
           }
           cout<<temp/prod<<endl;
       }
       else
       {
           cout<<-1<<endl;
       }
       
}