Cod sursa(job #2104482)
| Utilizator | Data | 11 ianuarie 2018 18:55:29 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool ciur[2000005];
int Ciur(int n)
{
int cnt=0;
ciur[1]=1;
for (int i=4;i<=n;i+=2)
ciur[i]=1;
for (int i=3;i*i<=n;i+=2)
if (ciur[i]==0)
for (int j=i*i;j<=n;j+=2*i) ciur[j]=1;
for (int i=2;i<=n;i++)
if (ciur[i]==0) cnt++;
return cnt;
//148933
}
int main()
{
int n;
fin>>n;
fout<<Ciur(n);
return 0;
}
