Cod sursa(job #2041358)
Utilizator | Data | 17 octombrie 2017 10:05:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <cstdio>
using namespace std;
int n;
char c[2000005];
int ciur(int n)
{
int nr=0;
for(int i=2;i<=n;i++)
{
if(c[i]==0)
{
nr++;
for(int j=i*2;j<=n;j+=i)
c[i]=0;
}
}
return nr;
}
int main()
{
freopen("pb.in","r",stdin);
freopen("pb.out","w",stdout);
scanf("%d",&n);
printf("%d",ciur(n));
return 0;
}