Cod sursa(job #1348045)
| Utilizator | Data | 19 februarie 2015 14:41:10 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, nr;
bool v[2000005];
int main()
{
fin>>n;
fin.close();
int i,j;
v[1]=1;
i=2;
do
{
if ( v[i] == 0)
for (j = 2*i ; j <= n ; j = j + i)
v[j] = 1;
i++;
}
while (i <= n);
nr = 0;
for (i = 2; i <= n; i++)
if (v[i] == 0)
nr++;
fout<<nr<<'\n';
fout.close();
return 0;
}
