1059 Prime Factors (25分)

Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p​1​​​k​1​​​​×p​2​​​k​2​​​​×⋯×p​m​​​k​m​​​​.

Input Specification:

Each input file contains one test case which gives a positive integer N in the range of long int.

Output Specification:

Factor N in the format N = p​1​​^k​1​​*p​2​​^k​2​​*…*p​m​​^k​m​​, where p​i​​'s are prime factors of N in increasing order, and the exponent k​i​​ is the number of p​i​​ -- hence when there is only one p​i​​, k​i​​ is 1 and must NOT be printed out.

Sample Input:

97532468

Sample Output:

97532468=2^2*11*17*101*1291

#define _CRT_SECURE_NO_WARNINGS
#include <climits>
#include<iostream>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<algorithm>
#include<string>
#include<cmath>
using namespace std;
bool Prime[100000];
void Make_Prime(int N)
{
    fill(Prime, Prime + N+1, true);
    for (int i = 2; i<N;i++)
    {
        if (!Prime[i])continue;
        for (int j = 2; i * j <N; j++)
            Prime[i * j] = false;
    }
}

int main()
{
    Make_Prime(100000);
    long long N;
    cin >> N;
    cout << N << "=";
    if (N == 1)
        cout << N;
    bool have = false;
    for (int i = 2; i < N; i++)
    {
        bool flag = false;
        int count = 0;
        while(Prime[i] && N % i == 0)
        {
            flag = true;
            count++;
            N /= i;
        }
        if (flag)
        {
            if (have)cout << "*";
            cout << i;
            if (count > 1)
                cout << "^" << count;
            have = true;
        }
    }
    if (N > 1)
        if (have)cout << "*" << N;
        else cout << N;
}