Cod sursa(job #1816961)
Utilizator | Data | 27 noiembrie 2016 10:51:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <cstdio>
using namespace std;
int i,k,n,j;
bool v[2000001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);k=0;
for(i=2;i<=n;i++)
if(v[i]==0)
{ k++;
for(j=i+i;j<=n;j=j+i)
v[j]=1;
}
printf("%d",k);
return 0;
}