PAT 1059 Prime Factors (25 分)

原题

思路

建立素数表存进数组，把输入的整数n从2开始遍历素数除尽，记录被每个素数除的次数。

code

#include <iostream>
#include <cmath>
using namespace std;
const int maxn = 100010;
bool isprime(int n) //判断是否为素数
{
    if (n == 1)
        return false;
    int sqr = (int)sqrt(1.0 * n);
    for (int i = 2; i <= sqr; i++)
    {
        if (n % i == 0)
            return false;
    }
    return true;
}
int prime[maxn], pNum = 0;
void Findprime() //建立素数表
{
    for (int i = 1; i < maxn; i++)
    {
        if (isprime(i) == true)
            prime[pNum++] = i;
    }
}
struct factor
{
    int x, cnt;
} fac[10];
int main()
{
    Findprime();
    int n, num = 0;
    cin >> n;
    if (n == 1)
        cout << "1=1";
    else
    {
        cout << n << "=";
        int sqr = (int)sqrt(1.0 * n);
        for (int i = 0; i < pNum && prime[i] <= sqr; i++)
        {
            if (n % prime[i] == 0)
            {
                fac[num].x = prime[i];
                fac[num].cnt = 0;
                while (n % prime[i] == 0)
                {
                    fac[num].cnt++;
                    n /= prime[i];
                }
                num++;
            }
            if (n == 1)
                break;
        }
        if (n != 1)
        {
            fac[num].x = n;
            fac[num++].cnt = 1;
        }
        for (int i = 0; i < num; i++)
        {
            if (i > 0)
                cout << "*";
            cout << fac[i].x;
            if (fac[i].cnt > 1)
            {
                cout << "^" << fac[i].cnt;
            }
        }
    }
    return 0;
}```