Cod sursa(job #2090019)
| Utilizator | Data | 17 decembrie 2017 14:51:40 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool fr[2000001];
int N,i,j,nr;
int main()
{
fin>>N;
fr[0]=fr[1]=1;
for(i=2;i<=N;i++)
{
if(fr[i]==0) //este prim
{
nr++;
for(j=i+i;j<=N;j=j+i)
fr[j]=1;
}
}
fout<<nr;
}
