Cod sursa(job #313712)
| Utilizator | Data | 9 mai 2009 16:50:54 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<stdio.h>
#include<math.h>
using namespace std;
long long n,v[2000005],tot;
int main()
{
long long i,j;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%lld",&n);
for(i=2;i<=n;i++)
{
if(!v[i])
{
if(i<=sqrt(n))
{
for(j=i+i;j<=n;j+=i)
{
if(j%i==0)v[j]=1;
}
}
}
}
for(i=2;i<=n;i++)
{
if(!v[i])tot++;
}
printf("%lld",tot);
return 0;
}
