aoc

advent of code
git clone git://source.orangerot.dev:/aoc.git
Log | Files | Refs

test.c (506B)

      1 #include <stdio.h>
      2 int main()
      3 {
      4     int n;
      5     int num = 1;
      6     printf("Enter the number you want: ");
      7     scanf("%d", &n);
      8     for(int i=2; i*i<=n; i++)
      9     {
     10         while(n%i==0)//find all the occurrences of a prime factor
     11         {
     12             printf("%d\n",i);
     13             if (num % i != 0)
     14                 num *= i;
     15             n/=i;
     16         }
     17     }
     18     if(n!=1)//if the number was originally a prime
     19     {
     20         printf("%d",n);
     21         num *= n;
     22     }
     23     printf("new %d\n", num);
     24     return 0;
     25 }