BZOJ 4803(逆欧拉函数-搜索)

已知phi(N)，求N。

由于N的素因子一定是phi(N)的某个因子+1
计算出N所有可能的素因子暴搜

#include<bits/stdc++.h>  
using namespace std; 
#define For(i,n) for(int i=1;i<=n;i++) 
#define Fork(i,k,n) for(int i=k;i<=n;i++) 
#define ForkD(i,k,n) for(int i=n;i>=k;i--) 
#define Rep(i,n) for(int i=0;i<n;i++) 
#define ForD(i,n) for(int i=n;i;i--) 
#define RepD(i,n) for(int i=n;i>=0;i--) 
#define Forp(x) for(int p=pre[x];p;p=next[p]) 
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])   
#define Lson (o<<1) 
#define Rson ((o<<1)+1) 
#define MEM(a) memset(a,0,sizeof(a)); 
#define MEMI(a) memset(a,0x3f,sizeof(a)); 
#define MEMi(a) memset(a,128,sizeof(a)); 
#define MEMx(a,b) memset(a,b,sizeof(a)); 
#define INF (0x3f3f3f3f) 
#define F (1000000007) 
#define pb push_back 
#define mp make_pair 
#define fi first 
#define se second 
#define vi vector<int>  
#define pi pair<int,int> 
#define SI(a) ((a).size()) 
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans); 
#define PRi(a,n) For(i,n-1) cout<<a[i]<<" "; cout<<a[n]<<endl; 
#define PRi2D(a,n,m) For(i,n) { \ 
                    For(j,m-1) cout<<a[i][j]<<" ";\ 
                    cout<<a[i][m]<<endl;\ 
                    }  
#pragma comment(linker, "/STACK:102400000,102400000") 
#define ALL(x) (x).begin(),(x).end() 
#define gmax(a,b) a=max(a,b); 
#define gmin(a,b) a=min(a,b); 
typedef long long ll; 
typedef long double ld; 
typedef unsigned long long ull; 
inline int read() 
{ 
    int x=0,f=1; char ch=getchar(); 
    while(!isdigit(ch)) {if (ch==45) f=-1; ch=getchar();} 
    while(isdigit(ch)) { x=x*10+ch-48; ch=getchar();} 
    return x*f; 
}  
typedef unsigned int UInt;
typedef unsigned long long ULL;
const UInt base1[] = { 2, 7, 61, 0 };
const UInt base2[] = { 2, 325, 9375, 28178, 450775, 9780504, 1795265022, 0 };
const UInt prime[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53 };
template <typename T>
inline T add(T a, T b, T mod){
    return a + b - (a + b >= mod ? mod : 0);
}
inline UInt mul(UInt a, UInt b, UInt mod){
    return (ULL)a * b % mod;
}
ULL mul(ULL a, ULL b, ULL mod){
    ULL ret = 0;
    for (ULL t = a; b; b >>= 1){
        if (b & 1)ret = add(ret, t, mod);
        t <<= 1;
        if (t >= mod)t -= mod;
    }
    return ret;
}
template <typename T>
T power(T a, T b, T mod){
    T ret = 1;
    for (T t = a; b; b >>= 1){
        if (b & 1)ret = mul(ret, t, mod);
        t = mul(t, t, mod);
    }
    return ret;
}
//n为小于2^63的非1奇数，正确性100%
template <typename T>
bool millerRabin(T n)
{
    int s = 0;
    T r = n;
    for (r--; !(r & 1); r >>= 1)s++;
    for (const UInt *base = typeid(T) == typeid(UInt) ? base1 : base2; *base; base++){
        T t = power(*base % n, r, n);
        if (t == 0 || t == 1 || t == n - 1)continue;
        for (int j = 1; j < s; j++){
            t = mul(t, t, n);
            if (t == 1)return false;
            if (t == n - 1)break;
        }
        if (t != n - 1)return false;
    }
    return true;
}
template <typename T>
bool checkPrime(T n)
{
    if (n == 1)return false;
    for (int i = 0; i < sizeof(prime) / sizeof(int); i++){
        if (n % prime[i] == 0)return n == prime[i];
    }
    return millerRabin(n);
}


ll K;
int sz;
priority_queue<ll > q;
vector<ll> v;
void dfs(int i,ll aim,ll now) {
    if (aim==1) {
        q.push(now);
        while(q.size()>K) q.pop();
        return;
    }
    if (sz==i) return;
    dfs(i+1,aim,now);
    if (aim%(v[i]-1)==0) {
        aim/=v[i]-1;
        now*=v[i];
        dfs(i+1,aim,now);
        while(aim%v[i]==0) {
            aim/=v[i];
            now*=v[i];
            dfs(i+1,aim,now);
        }
    }
}

int main() 
{ 
//  freopen("bzoj4803.in","r",stdin); 
    //  freopen(".out","w",stdout);
    ll n;cin>>n>>K; 
    For(i,K) q.push(1ll<<60);

    for(ll i=1;i*i<=n;i++) {
        if (n%i==0) {
            if (checkPrime((ull)i+1)) {
                v.pb(i+1);
            }
            if (i*i<n) {
                if (checkPrime((ull)n/i+1)) {
                    v.pb(n/i+1);
                }
            }
        }
    }
    sort(ALL(v));
    sz=SI(v);
    dfs(0,n,1);
//    cout<<v.size()<<endl;
//    Rep(i,SI(v)) cout<<v[i]<<" ";puts("");

//  Rep(i,sz) cout<<v[i]<<' ';
    vector<ll> ans;
//  cout<<q.size()<<endl;
    Rep(i,K){
        ans.pb(q.top());q.pop();
    }
    ForD(i,K-1) {
        printf("%lld ",ans[i]);
    }
    printf("%lld\n" , ans[0]);
    return 0; 
}