题解 | #质数因子#华为机试
质数因子
http://www.nowcoder.com/practice/196534628ca6490ebce2e336b47b3607
//开根号法：如果一个数在它的根号左边或右边没有质数，那么这个数的质数只有1和它本身
#include<stdio.h>
#include<math.h>
int main() {
long int n;
scanf("%ld", &n);
int i = 2;
int j=0;
for(;i<=sqrt(n);){
if(n%i==0){
printf("%d ", i);
n /= i;
continue;
}else
i++;
j++;
}
printf("%d ",n);
return 0;
}
#include<math.h>
int main() {
long int n;
scanf("%ld", &n);
int i = 2;
int j=0;
for(;i<=sqrt(n);){
if(n%i==0){
printf("%d ", i);
n /= i;
continue;
}else
i++;
j++;
}
printf("%d ",n);
return 0;
}
