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₁^k₁ * p₂^k₂ *…*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₁^k₁ * p₂^k₂ *…*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

---

题目大意：

代码：

#include<stdio.h>
#include<vector>
using namespace std;
vector<int> prime(500000,1);
int main()
{
    long long i,j,n,m,k,t,cnt;
    for(i=2;i*i<500000;i++)
    {
        for(j=2;j*i<500000;j++)
        {
            prime[i*j]=0;
        }
    }
    scanf("%lld",&n);
    printf("%lld=",n);
    if(n==1)
    {
        printf("1\n");
        return 0;
    }
    long long state=0;
    for(i=2;n>=2;i++)
    {
        cnt=0;
        while(prime[i]==1&&n%i==0)
        {
            cnt++;
            n=n/i;
        }
        if(cnt!=0)
        {
            if(state!=0)
                printf("*");
            printf("%lld",i);
            state=1;
        }
        if(cnt>1)
        {
            printf("^%lld",cnt);
        }
    }
    return 0;
}