Cod sursa(job #1952476)
Utilizator | Data | 4 aprilie 2017 10:17:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
#define NMAX 2000010
using namespace std;
ifstream fin("date.in");
ofstream fout("date.out");
int n,nr;
bool v[NMAX];
int main()
{
fin>>n;
for(int i=2;i<=n;i++){
for(int j=i*i;j<=n;j=i+j)
v[j]=true;
}
for(int i=2;i<=n;i++)
if(!v[i])
nr++;
fout<<nr;
return 0;
}