Advertisement
Guest User

Untitled

a guest
Apr 12th, 2013
87
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.92 KB | None | 0 0
  1. /*
  2.     By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
  3.     What is the 10 001st prime number?
  4. */
  5.  
  6. #include <stdio.h>
  7. #include <stdbool.h>
  8.  
  9. int main(void)
  10. {
  11.     int i, j, primen = 2;
  12.     bool isPrime;
  13.  
  14.     for ( i = 5; i <= 1000000000; i +=2 )     // count from 5 to 1 mil
  15.     {
  16.         isPrime = true;     // set isPrime to true
  17.  
  18.         for ( j = 2; j < i / 2; j++ )     // count from 2 to i / 2 within i
  19.         {
  20.             if ( i % j == 0 )     // if i / j is whole number, i is not prime
  21.                 isPrime = false;
  22.         }
  23.  
  24.         if ( isPrime != false)     // if isPrime is not false, increase primen
  25.         {
  26.             primen++;
  27.             if ( primen == 10001 )     // print primen and terminate when it's 100001
  28.             {
  29.                 printf("%i\n", i);
  30.                 return 1;
  31.             }
  32.         }
  33.     }
  34.  
  35.     return 0;
  36. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement