Cod sursa(job #1888172)
Utilizator | Data | 21 februarie 2017 22:49:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000005];
int n,i,j,nr;
int main()
{
fin>>n;
v[0]=1;
v[1]=1;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
nr++;
for(j=i+i;j<=n;j+=i)
{
v[j]=1;
}
}
}
fout<<nr;
return 0;
}