Cod sursa(job #1863842)
Utilizator | Data | 31 ianuarie 2017 11:38:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <stdio.h>
#define N 2000001
using namespace std;
bool ciur[N];
int main()
{
int n,i,nr=0,j;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2; i*i<=n; i++)
{
if(!ciur[i])
{
for(j=i*i; j<=n; j+=i)
{
ciur[j]=true;
}
}
}
for(i=2; i<=n; i++)
{
if(!ciur[i])
{
nr++;
}
}
printf("%d",nr);
return 0;
}