Cod sursa(job #1031163)
Utilizator | Data | 15 noiembrie 2013 17:31:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
/*
Keep It Simple!
*/
#include<stdio.h>
int n,cnt;
bool v[2000001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
cnt = 1;
for(int i=3;i<=n;i+=2)
{
if(v[i] == 0)
{
cnt++;
for(int j=i;j<=n;j+=i)
v[j] = 1;
}
}
printf("%d",cnt);
}