Cod sursa(job #2163287)
Utilizator | Data | 12 martie 2018 17:38:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
char ciur[2000001];
int main()
{
int n,i,d,nr;
fin >>n;nr=0;
ciur[0]=1;
ciur[1]=1;
for (i=2;i*i<=2000000;i++)
{if (ciur[i]==0) {for (d=i*i;d<=2000000;d=d+i)
ciur[d]=1;}}
i=0;
while (n>=i)
{if (ciur[i]==0) nr++;
i++;}
fout <<nr;
return 0;
}