Cod sursa(job #2662838)
Utilizator | Data | 24 octombrie 2020 16:47:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
//
// Created by christi on 10/24/2020.
//
#include <stdio.h>
int ciur[2000000], nr;
int main(){
int n, i;
FILE *in, *out;
in = fopen ("ciur.in", "r");
out = fopen ("ciur.out", "w");
fscanf("%d", &n);
for(i = 2; i <= n; i++){
if(ciur[i] == 0){
for(int j = i+i; j <= n; j += i)
ciur[j] = 1;
nr++;
}
}
fprintf("%d", nr);
return 0;
}