Cod sursa(job #1387454)
Utilizator | Data | 14 martie 2015 11:06:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
bool v[2000001];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n, i, d, s=0;
fin>>n;
v[1]=true;
v[0]=true;
for(d=2; d*d<=n; d++)
if(v[d]==false)
for(i=d*d; i<=n; i=i+d)
v[i]=true;
for(i=1; i<=n; i++)
if(v[i]==false)
s++;
fout<<s;
return 0;
}