Cod sursa(job #1747076)
Utilizator | Vasile Sebastian Costinel zVoxty | Data | 24 august 2016 14:52:28 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <stdio.h>
#include <vector>
#include <algorithm>
int isprime(int N){
if(N<2 || (!(N&1) && N!=2))
return 0;
for(int i=3; i*i<=N; i+=2){
if(!(N%i))
return 0;
}
return 1;
}
int main(){
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int number;
scanf("%d", &number);
std::vector<int> primes;
for (int i = 1; i <= number; ++i)
{
if(isprime(i)){
primes.push_back(i);
}
}
printf("%d", primes.size());
return 0;
}