Divisors

typedef vector<ll> vi;
void rec(ll*f,ll*c,int p,int L,vi&o,ll S){
    if(p==L)o.PB(S);
    else got(int i=0;i<c[p]+1;++i)rec(f,c,p+1,L,o,S),S*=f[p];
}
void dsr(int N,vi&o){
    o.clear();
    static ll f[64],c[64];
    int L=fc(N,f,c); //L factors will be in "f" (count == "c") - after pollard-rho
    rec(f,c,0,L,o,1);
//    sort(o.begin(),o.end());
}