Cod sursa(job #1910785)
Utilizator | Data | 7 martie 2017 18:17:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
int a[2000003],n;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
void ciur()
{
int i,j;
a[1]=1;
for(i=2;i*i<=2000000;i++)
if(a[i]==0)
for(j=i*i;j<=2000000;j+=i)
a[j]=1;
}
int main()
{
ciur();
fin>>n;
int i;
long long nr=0;
for(i=2;i<=n;i++)
if(a[i]==0)nr++;
fout<<nr<<"\n";
return 0;
}