Cod sursa(job #1356171)
Utilizator | Data | 23 februarie 2015 11:24:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char a[20000000];
int i,j,n,nr;
int main()
{
fin>>n;
a[0]=a[1]=0;
for(i=2;i*i<=n;i++)
{
if(a[i]==0)
for(j=i*i;j<=n;j+=i)
{
a[j]=1;
}
}
nr=1;
for(i=3;i<n;i+=2)
if(a[i]==0) nr++;
fout<<nr<<endl;
return 0;
}