Cod sursa(job #1582573)
Utilizator | Data | 28 ianuarie 2016 09:15:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
using namespace std;
int n, cnt;
char ciur[2000005];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for(int i=2;i<=n;++i)
ciur[i]=1;
for(int i=2;i<=n;i++)
if(ciur[i]){
++cnt;
for(int j=i+i;j<=n;j+=i)
ciur[j]=0;
}
printf("%d", cnt);
return 0;
}