Cod sursa(job #1740496)
Utilizator | Data | 11 august 2016 17:29:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<stdio.h>
using namespace std;
FILE *f1=fopen("ciur.in","r");
FILE *f2=fopen("ciur.out","w");
int N,i,nr,j;
char v[2000005];
int main(){
fscanf(f1,"%d",&N);
fclose(f1);
for (i=4;i<=N;i+=2)
v[i]=1;
nr=1;
i=3;
while(i<=N){
if (v[i]==0)
{
nr++;
j=i*i;
while(j<=N){
v[j]=1;
j=j+i;
}
}
i=i+2;
}
fprintf(f2,"%d",nr);
fclose(f2);
return 0;
}