#include<cstdio>
#include<math.h>
bool isprime(int n)
{
if (n <= 1) return false;
int sqr = (int)sqrt(1.0*n);
for (int i = 2; i <= sqr; i++)
{
if (n%i == 0) return false;
}
return true;
}
const int maxn = 100010;
int prime[maxn];
int seq = 0;
void findprime()
{
for (int i = 2; i < maxn; i++)
{
if (isprime(i)) prime[seq++] = i;
}
}
struct factor
{
int x, cnt;//质因子,个数
}fac[10];
int main()
{
findprime();
int n;
int num = 0;//记录不同质因子个数
scanf("%d", &n);
if (n == 1) printf("1=1");
else
{
printf("%d=", n);
//枚举sqr以内的质因子
int sqr = (int)sqrt(1.0*n);
for (int i = 0; prime[i] <= sqr; i++)
{
if (n%prime[i] == 0)
{
fac[num].x = prime[i];
fac[num].cnt = 0;
while (n%prime[i] == 0)
{
fac[num].cnt++;
n /= prime[i];
}
num++;
}
if (n == 1) break;
}
if (n != 1)//可能存在一个大于sqr的质因子
{
fac[num].x = n;
fac[num].cnt = 1;
num++;
}
}
for (int i = 0; i < num; i++)
{
printf("%d", fac[i].x);
if (fac[i].cnt != 1)
{
printf("^%d", fac[i].cnt);
}
if (i != num - 1) printf("*");
}
return 0;
}
1059 Prime Factors (25 分)
最新推荐文章于 2021-08-31 21:12:28 发布