-
Notifications
You must be signed in to change notification settings - Fork 0
/
primes.c
40 lines (31 loc) · 768 Bytes
/
primes.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
/*
* primes.c
* Řešení IJC-DU1
* Autor: Tomáš Matuš, FIT
* Login: xmatus37
* Datum: 15.3.2021
* Přeloženo: gcc 10.2.0
*/
#include "bitset.h"
#include "eratosthenes.h"
#include <stdio.h>
#include <time.h>
#define ARRAY_SIZE 200000000 // 200 million
int main() {
clock_t start = clock();
bitset_create(p, ARRAY_SIZE)
Eratosthenes(p);
int toRead = 0;
unsigned long primes[10];
for (bitset_index_t i = ARRAY_SIZE - 1; toRead < 10; i--) {
if (bitset_getbit(p,i) == 0) {
primes[toRead] = i;
toRead++;
}
}
for (int i = 9; i >= 0 ; i--) {
printf("%lu\n", primes[i]);
}
fprintf(stderr, "Time=%.3g\n", (double)(clock() - start) / CLOCKS_PER_SEC);
return 0;
}