Cod sursa(job #927944)
| Utilizator | Data | 26 martie 2013 09:52:41 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool ciur[2000000];
int main()
{
long x,i,n,con=0,j;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
x=2000000;
cout<<x;
for (i=2;i<=x;i++)
ciur[i]=1;
ciur[1]=0;
for (i=2;i*i<=x;i++)
if (ciur[i])
for (j=2;j*i<x;j++)
ciur[i*j]=0;
for (i=2;i<=n;i++)
if (ciur[i]==1) con++;
fout<<con;
fin.close();
fout.close();
return 0;
}
