Cod sursa(job #1010717)
Utilizator | Data | 15 octombrie 2013 15:44:14 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
unsigned n,nr,a[2000001],i,j;
int main()
{
fin>>n;
nr++;
for(i=3;i*i<=n;i+=2)
{
if(!a[i])
nr++;
for(j=i*i;j<=n;j+=2*i)
a[j]=1;
}
for(;i<=n;i++)
if(!a[i]&&i%2)
nr++;
fout<<nr;
return 0;
}