Cod sursa(job #2720540)
Utilizator | Data | 10 martie 2021 22:34:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
#define nmax 2000002
using namespace std;
bool ciur[nmax];
int c(int n)
{
int s=0;
for(int i=2;i<=n;i++)
{
if(ciur[i]==0)
{
s++;
for(int j=i;j<=n;j+=i) ciur[j]=1;
}
}
return s;
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.in","r",stdin);
int n;
cin>>n;
cout<<c(n);
return 0;
}