Cod sursa(job #574383)
Utilizator | Data | 7 aprilie 2011 09:30:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<iostream>
#include<fstream>
using namespace std;
int a[2000005],n,i,j,c=1;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=4;i<=n;i=i+2)
{
a[i]=1;
}
for(i=3;i<=n;i=i+2)
{
if(a[i]==0)
{
for(j=2*i;j<=n;j=j+i)
{
a[j]=1;
}
}
if(a[i]==0) c++;
}
fout<<c;
fin.close();
fout.close();
return 0;
}