describe
Input a number, output its prime factorization expression.
Enter Enter an integer n (2 <= n < 100). output outputs the factorization expression for this integer.
Arrange the prime numbers in the expression from smallest to largest.
If the integer can be decomposed into the b power of the factor a, when b is greater than 1, it is written as a^b; when b is equal to 1, it is directly written as a. sample input
60
Sample output
2^2*3*5
#include <iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int a[10];
void f(int b,int pri[],int k){
while(b!=1){
for(int i =0;i<k;i++){
if(pri[i]==0)
continue;
if(b%pri[i]==0){
a[i]++;
b= b/pri[i];
}
}
}
}
int main()
{
int num;
cin>>num;
int k=0;
int pri[100];
memset(pri,0,sizeof(pri));
memset(a,0,sizeof(a));
int flag =0;
for(int i =2;i<100;i++){
flag =0;
for(int j =2;j<i;j++){
if(i%j ==0){
flag =1;
break;
}
}
if(flag ==0){
pri[k++] = i;
}
}
f(num,pri,k);
int flag2= 0;
for(int i =0;i<sizeof(a)/sizeof(int);i++){
if(a[i]!=0){
if(flag2==0){
flag2 =1;
}
else{
cout<<"*";
}
}
if(a[i]==1)
cout<<pri[i];
if(a[i]>1)
cout<<pri[i]<<"^"<<a[i];
}
return 0;
}