Cod sursa(job #2275609)
Utilizator | Data | 3 noiembrie 2018 12:45:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<stdio.h>
int nb;
int N;
bool notprimes[2000001];
int main(){
FILE* f= fopen("ciur.in","rt");
FILE* g= fopen("ciur.out","wt");
fscanf(f,"%d",&N);
for(int i=2;i<=N;i++){
if(notprimes[i]==false){
nb++;
for(int j=2*i;j<=N;j+=i)
notprimes[j]=true;
}
}
fprintf(g,"%d",nb);
fclose(g);
fclose(f);
return 0;
}