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