Cod sursa(job #2689767)
Utilizator | Data | 22 decembrie 2020 02:15:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main(){
ll n;
fin>>n;
bool v[n];
int counter = 1;
for(int i = 2; i <= n; i+=2) {
v[i] = 1;
}
for(int i = 3; i <= n; i+=2) {
if(v[i] != 1) {
counter++;
for(int j = i<<1; j <= n; j+=i){
v[j] = 1;
}
}
}
fout<<counter;
}