aboutsummaryrefslogtreecommitdiffstats
path: root/10001prime.c
diff options
context:
space:
mode:
authormjfernez <mjfernez@gmail.com>2020-02-09 15:16:26 -0500
committermjfernez <mjfernez@gmail.com>2020-02-09 15:16:26 -0500
commit93ea7fe5957b62f18e8fbd17a21696bd7de6332d (patch)
treed90aed60d687bcf195f1150777f37cbe8a149814 /10001prime.c
parent125ec5bc3d8bfc224b7d32bcfbbc37b9fb5d441f (diff)
downloadProject_Euler_Solutions-93ea7fe5957b62f18e8fbd17a21696bd7de6332d.tar.gz
Organized everything, update README
Diffstat (limited to '10001prime.c')
-rw-r--r--10001prime.c42
1 files changed, 0 insertions, 42 deletions
diff --git a/10001prime.c b/10001prime.c
deleted file mode 100644
index 2ef3bd8..0000000
--- a/10001prime.c
+++ /dev/null
@@ -1,42 +0,0 @@
-#include <stdio.h>
-#include <stdlib.h>
-#include <math.h>
-int n = 1000000;
-
-int *listPrimes(int num){
- int i;
- int *primes;
- int *sieve = (int *) malloc(num * sizeof(int));
- //initialize to all 1s (except 0 and 1 which are not prime)
- for(i = 2; i < num; i++)
- sieve[i] = 1;
- for(i = 2; i < ceil(sqrt(num)); i++){
- if(sieve[i] == 1){
- int j = i * i;
- while(j < num){
- sieve[j] = 0;
- j += i;
- }
- }
- }
-
- //now check which were prime
- int s = 0;
- primes = (int *) malloc(sizeof(int));
- for(i = 2; i < num; i++){
- if(sieve[i]){
- primes[s] = i;
- s++;
- primes = (int *) realloc (primes, (s + 1) * sizeof(int));
- }
- }
-
- return primes;
-}
-
-int main(){
- int *p = listPrimes(n);
- int prime10001 = p[10000];
- printf("%d\n", prime10001);
- return 0;
-}