PAT A1059. Prime Factors (25)

最新推荐文章于 2022-05-06 14:14:10 发布

jackiewoo_

最新推荐文章于 2022-05-06 14:14:10 发布

阅读量107

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/jackiewoo_/article/details/79432781

版权

PAT 专栏收录该内容

101 篇文章 0 订阅

订阅专栏

Prime Factors (25)

时间限制
100 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
HE, Qinming
Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p1^k1 * p2^k2 *…*pm^km.

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 = p1^k1 * p2^k2 *…*pm^km, where pi’s are prime factors of N in increasing order, and the exponent ki is the number of pi – hence when there is only one pi, ki is 1 and must NOT be printed out.

Sample Input:
97532468
Sample Output:
97532468=2^2*11*17*101*1291

#include<cstdio>
#include<cmath>
using namespace std;
const int maxn=33;
int n;
int a[maxn];
int cnt=0;

void findp(int n){
    if(n<=1) return;
    for(int i=2;i<=n;i++){
        if(n%i==0){
            a[cnt++]=i;
            n/=i;
            findp(n);
            return;
        }
    }
}
int main(){
    scanf("%d",&n);
    printf("%d=",n);
    if(n==1){
        printf("1");
        return 0;
    }
    findp(n);
    printf("%d",a[0]);
    int k=1;
    for(int i=1;i<cnt;i++){
        if(a[i]==a[i-1]){
            k++;
        }else{
            if(k!=1)printf("^%d",k);
            k=1;
            printf("*%d",a[i]);
        }
    }
    if(k!=1)printf("^%d",k);
    return 0;
}