Cod sursa(job #1747229)
Utilizator | Data | 24 august 2016 17:13:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <vector>
#include <stdio.h>
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int number;
scanf("%d", &number);
std::vector<int> primes;
std::vector<int> checked;
int result = 0;
for(int i = 0; i <= number; i++){
primes.push_back(0);
checked.push_back(0);
}
for(int i = 2; i <= number; i++){
if(!checked[i]){
result++;
for(int j = i*2; j <=number; j+=i){
checked[j] = 1;
}
}
}
printf("%d",result);
return 0;
}