Cod sursa(job #1424748)
| Utilizator | Data | 25 aprilie 2015 14:17:14 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
const int N = 2000001;
bool c[N];
int main()
{
int i,j,n, nr = 0;
in>>n;
for(i=2; i*i<N; i++)
if(!c[i])
for(j=i*i; j<N; j+=i)
c[j]=true;
for(i = 2; i <= n; i++)
if (! c[i])
nr++;
out<<nr;
return 0;
}
