1059. Prime Factors (25)

1059. Prime Factors (25)

#include <stdio.h>#include <math.h>long int a[1000][2];int main(){    long int n,m,i=2;    int k=0;    scanf("%ld",&n);    m=n;    if(n==1)    {        printf("1=1");        return 0;    }    while(n!=1)    {        while(i<=n)        {            if(n%i==0)                break;            else                ++i;        }        int c=0;        while(n%i==0)        {            ++c;            n/=i;        }        a[k][0]=i;        a[k][1]=c;        ++k;    }    printf("%ld=",m);    for(i=0;i<k;i++)    {        if(i!=0)printf("*");        if(a[i][1]==1)            printf("%ld",a[i][0]);        else            printf("%ld^%ld",a[i][0],a[i][1]);    }    return 0;}