poj 3421 素因子个数和

题意：

无法理解X_i < X_i+1 and X_i | X_i+1 where a | b means a perfectly divides into b.这句话的意思。

解析：

网上的解析，求下面这些数，直接写求下面这些数的代码了。

n可以分解成质因子的乘积。

n = p1^a1 * p2^a2 * p3^a2.....pn^an.

最大长度就为以上所有的质因子的个数和 ans = a1+a2+a3...+an,

链的数量便为以上各数的排列组合 = ans！/ a1! * a2! * ...* an!.  

代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <climits>
#include <cassert>
#define LL long long
#define lson lo, mi, rt << 1
#define rson mi + 1, hi, rt << 1 | 1

using namespace std;
const int maxn = 5e6 + 10;///5e6
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const double pi = acos(-1.0);
const double ee = exp(1.0);

int prime[maxn];
bool isprime[maxn];
int nprime;
void primeTable()
{
    //int m = sqrt(maxn + 0.5);
    nprime = 0;
    memset(isprime, true, sizeof(isprime));
    memset(prime, 0, sizeof(prime));
    for (LL i = 2; i < maxn; i++)
    {
        if (isprime[i])
        {
            prime[++nprime] = i;
            for (LL j = i * i; j < maxn; j += i)
            {
                isprime[j] = false;///LL  RE
            }
        }
    }
}

LL fact[30];
void factTable()
{
    fact[1] = 1;
    for (int i = 2; i <= 29; i++)
    {
        fact[i] = fact[i - 1] * i;
    }
}

LL Count(int x, int pri)
{
    LL res = 0;
    int t = 1;
    while (t <= x)
    {
        t *= pri;
        res += x / t;
    }
    return res;
}

int main()
{
#ifdef LOCAL
    freopen("in.txt", "r", stdin);
#endif // LOCAL
    primeTable();
    factTable();
    int n;
    while (~scanf("%d", &n))
    {
        int ans = 0;
        LL mu = 1;
        for (int i = 1; i <= nprime; i++)
        {
            if (n % prime[i] == 0)
            {
               int cnt = 0;
               while (n % prime[i] == 0)
               {
                   n /= prime[i];
                   cnt++;
               }
               mu *= fact[cnt];
               ans += cnt;
            }
            if (n == 1)
            {
                break;
            }
            if (isprime[n])
            {
                ans++;
                break;
            }
        }
        printf("%d %lld\n", ans, fact[ans] / mu);
    }
    return 0;
}