Cod sursa(job #1598950)
| Utilizator | Data | 13 februarie 2016 14:44:22 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
int n,viz[2000005];
void citire()
{
ifstream fin ("ciur.in");
fin>>n;
fin.close();
}
void rezolvare()
{
int i,j,nrprime=0;
ofstream fout ("ciur.out");
for (i=2; i*i<=n; i++)
if (!viz[i])
for (j=i*i; j<=n; j+=i)
viz[j]=1;
nrprime=0;
for (i=2; i<=n; i++)
if (!viz[i]) nrprime++;
fout<<nrprime;
fout<<'\n';
fout.close();
}
int main()
{
citire();
rezolvare();
return 0;
}
