Cod sursa(job #1048128)
| Utilizator | Data | 5 decembrie 2013 12:53:42 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
bool ciur[2000005];
int main()
{
int i,j,n,nr=0;
ifstream fin("ciur.in");
fin>>n;
for(i=3;i*i<=n;i+=2)
{
if(ciur[i]==false)
{
for(j=i*i;j<=n;j+=i*2)
{
ciur[j]=true;
}
}
}
for(i=4;i<=n;i+=2)
{
ciur[i]=true;
}
fin.close();
ofstream fout("ciur.out");
for(i=2;i<=n;i++)
{
if(ciur[i]==false)
nr++;
}
fout<<nr;
fout.close();
return 0;
}
