Cod sursa(job #1414168)
Utilizator | Data | 2 aprilie 2015 13:37:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<cstdio>
using namespace std;
bool psaspda[2000000];
int j,i,n,nr;
void ciur(int n)
{
for(i=2;i<=n;i++)
{
if(!psaspda[i])
{
for(j=2*i;j<=n;j+=i)
{
psaspda[j]=true;
}
}
}
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
ciur(n);
for(i=2;i<=n;i++)
{
if(!psaspda[i])
{
nr++;
}
}
printf("%d\n",nr);
}