Cod sursa(job #1875165)
Utilizator | Data | 10 februarie 2017 19:56:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
int q,n,cod,x,nr,i,j;
bool p[2000005];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=3;i<=n;i=i+2)
{
if(p[i]==0)
{
nr++;
if(i<1500)
{
for(j=i*i;j<=n;j=j+i)
p[j]=1;
}
}
}
nr++;
printf("%d",nr);
return 0;
}