Cod sursa(job #2280921)
Utilizator | Data | 11 noiembrie 2018 12:52:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,p[2000010];
int ciur(int n) {
int i,j,nr=1;
for (i=3;i<=n;i+=2) {
if (p[i]==0) {
nr++;
for (j=i+i+i; j<=n; j+=i<<1) {
p[j]=1;
}
}
}
return nr;
}
int main()
{
fin>>n;
fout<<ciur(n);
}