Cod sursa(job #1012783)
| Utilizator | Data | 19 octombrie 2013 17:16:06 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int a[2000001];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n;
scanf("%d", &n);
int sum =0;
for (int i=2; i<= n/2; i++){
if (a[i] == 0) {
int current = i+i;
while (current <=n){
a[current] = 1;
current +=i;
}
}
}
for (int i=2; i<=n; i++){
if (a[i] == 0){
sum++;
}
}
printf("%d", sum);
return 0;
}
