递归解法 #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; } ...