26 lines
506 B
C
26 lines
506 B
C
|
#include <stdio.h>
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
int n;
|
||
|
|
int num = 1;
|
||
|
|
printf("Enter the number you want: ");
|
||
|
|
scanf("%d", &n);
|
||
|
|
for(int i=2; i*i<=n; i++)
|
||
|
|
{
|
||
|
|
while(n%i==0)//find all the occurrences of a prime factor
|
||
|
|
{
|
||
|
|
printf("%d\n",i);
|
||
|
|
if (num % i != 0)
|
||
|
|
num *= i;
|
||
|
|
n/=i;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
if(n!=1)//if the number was originally a prime
|
||
|
|
{
|
||
|
|
printf("%d",n);
|
||
|
|
num *= n;
|
||
|
|
}
|
||
|
|
printf("new %d\n", num);
|
||
|
|
return 0;
|
||
|
|
}
|