Cod sursa(job #2041370)
Utilizator | Data | 17 octombrie 2017 10:12:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
using namespace std;
char ciur[2000005];
int n;
int ciurul(int n)
{
int nr=0;
for(int i=2;i<=n;i++)
{
if(ciur[i]==0)
{
nr++;
for(int j=i*2;j<=n;j+=i)
ciur[j]=1;
}
}
return nr;
}
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
//ciurul();
printf("%d", ciurul(n));
return 0;
}