Cod sursa(job #2442484)
| Utilizator | Data | 24 iulie 2019 09:50:59 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long Ciur(long long number){
bool vector[2000001];
long long nr = 0;
for (int i = 2; i <= number; i = i + 1){
vector[i] = 1;}
for (int i = 2; i <= number; i = i + 1){
if(vector[i]){
nr++;
for(int j = i + i; j <= number; j = j + i){
vector[j] = 0;
}
}
}
return nr;
}
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long long n;
fin >> n;
fout << Ciur(n) << '\n';
return 0;
}