Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #define MAX_N 100000
- unsigned char prime[MAX_N+1];
- int main() {
- unsigned int i, j, count = 0;
- // Assume everything is prime:
- for (i = 0; i <= MAX_N; i++)
- prime[i] = 1;
- // 0 and 1 are not primes:
- prime[0] = prime[1] = 0;
- // Generate Prime Numbers <Sieve>:
- for (i = 2; i <= MAX_N; i++)
- if (prime[i]) {
- if (++count == 1000) {
- printf("%d\n", i);
- return 0;
- }
- for (j = i*i; j <= MAX_N; j+=i)
- prime[j] = 0;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement