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