Cod sursa(job #1154740)
Utilizator | Data | 26 martie 2014 13:03:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream cin("ciur.in");
ofstream cout("ciur.out");
bool prim[2000005];
int n,i,j,c=1;
int main()
{
cin>>n;
for(i=3; i<=n; i++)
if(!prim[j])
for(j=i+i; j<=n; j+=i)
prim[j]=1;
for(i=3; i<=n; i++)
{
if(!prim[i] && i%2!=0)
c++;
}
if(n==0 || n==1)
c=0;
cout<<c;
}