Cod sursa(job #1488721)
| Utilizator | Data | 19 septembrie 2015 17:18:43 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#define N 2000003
using namespace std;
ifstream cin ("ciur.in");
ofstream cout("ciur.out");
bool a[N];
void ciur(int n)
{
for (int i=4;i<=n;i+=2)
a[i]=true;
for (int i=3;i*i<=n;i+=2)
if (a[i]==0)
for (int j=i*i;j<=n;j=j+2*i)
a[j]=true;
}
int main()
{
int n,nr,i;
cin>>n;
ciur (n);
nr=1;
for (i=3;i<=n;i+=2)
if (a[i]==false)
nr++;
cout<<nr;
return 0;
}
