Cod sursa(job #1554357)
Utilizator | Data | 21 decembrie 2015 12:12:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
using namespace std;
char a[2000000];
int ciur(int n)
{
int c=0;
for(int i=2; i<=n; i++)
{
if(a[i]==0)
{
int j=2*i;
while(j<=n)
{
a[j]=1;
j+=i;
}
c++;
}
}
return c;
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,c=0;
scanf("%d", &n);
printf("%d",ciur(n));
return 0;
}