Cod sursa(job #2163291)
Utilizator | Data | 12 martie 2018 17:39:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur[200001];
int main()
{
int n,i,j,nr;
fin>>n;
nr=0;
ciur[0]=1; ciur[1]=1;
for(i=2;i<=n;i++)
{
if(ciur[i]==0)
{
for(j=i*i;j<=n;j=j+i)
{
ciur[j]=1;
}
}
}
for(i=2;i<=n;i++)
{
if(ciur[i]==0){nr++;}
}
fout<<nr;
return 0;
}