Cod sursa(job #622073)
Utilizator | Data | 17 octombrie 2011 13:02:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<cstdio>
using namespace std;
int v[2000001];
int main(){
int n,nr=0,j,i;
FILE * pFile;
pFile=fopen("ciur.in","r");
fscanf(pFile,"%d",&n);
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++){
if(v[i]==1){
nr++;
for(j=i+i;j<=n;j+=i)
v[j]=0;}
}
pFile=fopen("ciur.out","w");
fprintf(pFile,"%d",nr);
return 0;
}