Cod sursa(job #2022595)
Utilizator | Groza Iulia Diana Groza_Iulia_Diana | Data | 16 septembrie 2017 19:35:58 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#define MAXN 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[MAXN];
int main()
{
int i, j, contor, n;
fin >> n;
for(i=3; i*i <=n; i+=2)
if(v[i]==false)
for(j=i*i; j<=n; j+= 2*i)
v[j] = true;
contor = 1;
for(i=3; i<=n; i += 2)
if(v[i]==false)
contor++;
fout << contor;
return 0;
}