Cod sursa(job #1792201)
| Utilizator | Data | 30 octombrie 2016 10:48:53 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,r,ciur[2000001],nr,j;
int main()
{
fin>>n;
r=sqrt(n);
for(i=2;i<=n;i++)
if(ciur[i]==0)
{
nr++;
if(i<=r)
for(j=i*i;j<=n;j+=i)
ciur[j]=1;
}
fout<<nr;
return 0;
}
