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