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