Cod sursa(job #2437561)
| Utilizator | Data | 9 iulie 2019 18:57:03 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int Ciur(long int number){
int vector[2000005];
int nr = 1;
for (int i = 3; i <= number; i = i + 2){
for(int j = i + i + i; j <= number; j = j + i + i){
vector[j] = 1;
}
if(vector[i] == 0){
nr++;
}
}
return nr;
}
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long int n, rez;
fin >> n;
rez = Ciur(n);
fout << rez << '\n';
return 0;
}