题解 | #质数因子#
质数因子
https://www.nowcoder.com/practice/196534628ca6490ebce2e336b47b3607
递归解法
#include <iostream>
#include <cmath>
using namespace std;
void PrimePrint(int number)
{
for(int i=2;i<=sqrt(number);i++)
{
if(number%i==0)
{
cout<<i<<" ";
PrimePrint(number/i);
return;
}
}
cout<<number;
}
int main() {
int number;cin>>number;
PrimePrint(number);
return 0;
}
