Cod sursa(job #351968)
Utilizator | Data | 29 septembrie 2009 21:45:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <stdio.h>
char v[2000001];
int n;
int cnt;
void ciur()
{
for (int i=2;i<=n;++i)
if (v[i]==0)
{
cnt++;
for (int j=i*i;j<=n;)
{
v[j]=1;
j+=i;
}
}
}
int main()
{
freopen ("ciur.in","r",stdin);
freopen ("ciur.out","w",stdout);
scanf ("%d",&n);
ciur();
printf ("%d",cnt);
return 0;
}