void toPrimMulti(int n, int m) {
if (n >= m) {
while (n % m != 0)
m++;
n /= m;
printf("%d ", m);
toPrimMulti(n, m);
}
}
toPrimMulti(21, 2);
转载于:https://www.cnblogs.com/yangyh/archive/2011/08/10/2133173.html
void toPrimMulti(int n, int m) {
if (n >= m) {
while (n % m != 0)
m++;
n /= m;
printf("%d ", m);
toPrimMulti(n, m);
}
}
toPrimMulti(21, 2);
转载于:https://www.cnblogs.com/yangyh/archive/2011/08/10/2133173.html