Cod sursa(job #392659)
Utilizator | Data | 7 februarie 2010 23:37:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<fstream>
#include<stdio.h>
#include<vector>
using namespace std;
bool v[2000005];
int main()
{long i,j,k,n;
ifstream fin("ciur.in");
fin>>n;
v[0]=v[1]=1;
k=0;
for(i=2;i<=n;i++)
{if(v[i]==0)
k++;
for(j=i*i;j<=n;j+=i)
{v[j]=1;
}
}
freopen("ciur.out","w",stdout);
printf("%ld \n",k);
return 0;
}