Cod sursa(job #1842579)
Utilizator | Data | 7 ianuarie 2017 11:34:10 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<stdio.h>
#pragma warning(disable:4996)
using namespace std;
int main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n, count = 0;
bool a[2000010];
scanf("%d", &n);
for (int i = 1; i <= n; i++)
a[i] = true;
for (int i = 2; i <= n; i++)
if (a[i]) {count++;
for (int j = i + i; j <= n; j += i)
a[j] = false;
}
printf("%d", count);
return 0;
}