Cod sursa(job #2761934)
| Utilizator | Data | 4 iulie 2021 15:17:54 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int maxim=100001;
int n,ciur[maxim];
void Ciur()
{
int i=2;
while(i<=maxim)
{
if(ciur[i]==0)
{
ciur[i]=1;
int j=i+i;
while(j<=maxim)
{
ciur[j]=2;
j=j+i;
}
}
i++;
}
}
int main()
{
int cnt=0;
fin>>n;
Ciur();;
for(int i=1;i<=n;i++)
if(ciur[i]==1)
cnt++;
fout<<cnt;
fin.close();
fout.close();
return 0;
}
