#include <iostream>
#include <string>
#include <stdlib.h>
#include <vector>
#include <cmath>
#include <stdio.h>
using namespace std;
int PrimeFactorization(int n)
{
for(int i = 2; i <= sqrt(n); i++)
{
if(n % i == 0)
{
int cnt = 0;
while(n % i == 0)
{
cnt++;
n = n/i;
}
for(int j = 0; j < cnt; j++)
{
cout << i << " * ";
}
}
}
if(n != 1)
cout << n<<endl;
}
int main ()
{
int i = 1;
while(i!=0)
{
scanf("%d",&i);
PrimeFactorization(i);
}
return 0;
}
因式分解成质数 Find prime factorization of an integer
最新推荐文章于 2020-01-01 23:37:52 发布