Cod sursa(job #1518059)
| Utilizator | Data | 5 noiembrie 2015 12:12:29 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<stdio.h>
#define FIN "ciur.in"
#define FOUT "ciur.out"
#define MAXN 2000002
using namespace std;
bool prim[MAXN];
int main()
{
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
int n;
scanf("%d", &n);
int counter = 0;
for(int i=2; i<=n; i++)
{
if(prim[i] == 0)
counter++;
for(int j=i*i; j<=n; j+=i)
prim[j] = 1;
}
printf("%d", counter);
return 0;
}
