pat a1059

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^211171011291

代码

#include
struct fac
{
    int x;
    int count=0;
}f[10];
const int max=1000001;
int p[max]={0};
int k=0;
bool fa[max]={false};
void pri()
{
    for(int i=2;i