Cod sursa(job #2955088)
Utilizator | Data | 16 decembrie 2022 08:56:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main(){
int n;
in>>n;
bool v[n]={};
for(int i=2;i<n;i++){
if(v[i]==0){
for(int j=2;i*j<n;j++){
v[i*j]=1;
}
}
}
int rasp=0;
for(int i=2;i<n;i++){
if(v[i]==0){
rasp++;
}
}
out<<rasp;
}