[Loops]D. Liang 4.16 Finding the factors of an integer
Description
Write a program that reads an integer n and displays all its smallest factors.
For example, if the input ingeger is 120, the output should be as follows:
2
2
2
3
5
Input
An integer n (1<n<20000).
Output
The smallest factors of n in nondescending order, each factor per line.
Sample Input
120
Sample Output
2
2
2
3
5
Thinking analysis: this question is to find all the prime factors of n.
// Date:2020/3/19
// Author:xiezhg5
#include <stdio.h>
int main(void)
{
int i;
int n;
scanf("%d",&n);
int m=n; //把n的值储存在m中
for(i=2;i<=m;i++) //遍历2到m的所有数字
{
int k=i; //用k储存i
while(n%k==0)
{
printf("%d\n",k); //打印n的因数
n=n/k; //找因数中的素数
}
}
return 0;
}