Cod sursa(job #2180286)
Utilizator | Data | 20 martie 2018 19:20:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool c[101];
int n,i,j,nr;
void ciur()
{
for(i=2; i<=n; i++)c[i]=1;
for(i=2; i<=n; i++)
{
if(c[i]==1)///i e prim=>multiplii pana la n vor fi zero
for(j=2; j*i<=n; j++)
c[i*j]=0;
}
}
int main()
{
fin>>n;
ciur();
for(i=2; i<=n; i++)
if(c[i]==1)nr++;
fout<<nr;
return 0;
}