Codeforces Round #256 (Div. 2)

#include <iostream>
#include <vector>
#include <algorithm>
#include <vector>
#define LL long long
using namespace std;

LL limit = 1e5;
vector<LL> divs,res;

bool solve(LL x, LL k){
if(k == 0 ||  x == 1){
res.push_back(x);
return res.size() >= limit;
}
for(int  i = 0 ;i < divs.size(); ++ i){
if(divs[i] > x) break;
if(x%divs[i] == 0){
if(solve(divs[i],k-1)) return true;
}
}
return false;
}

int main(){
LL x,k;
cin >> x >> k;
for(LL i = 1; i*i <= x; ++ i){
if(x%i == 0){
divs.push_back(i);
if(i*i != x) divs.push_back(x/i);
}
}
sort(divs.begin(),divs.end());
solve(x,k);
for(int i = 0 ; i < res.size(); ++ i){
if(i) cout<<" ";
cout<<res[i];
}
cout<<endl;
return 0;
}