Cod sursa(job #1264036)
| Utilizator | Data | 15 noiembrie 2014 14:37:21 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include "stdio.h"
#include "string.h"
#include "math.h"
using namespace std;
bool isPrime[100000000];
int main() {
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n, k = 0;
scanf("%d", &n);
memset(isPrime, true,sizeof(bool) * n);
for(int i = 2; i <= n;i++){
if(isPrime[i]){
k++;
for(int j = i + i; j <= n;j += i)
isPrime[j] = 0;
}
}
printf("%d", k);
return 0;
}