Cod sursa(job #2971597)
Utilizator | Data | 27 ianuarie 2023 17:52:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <bits/stdc++.h>
using namespace std;
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n;
cin>>n;
bool a[n]={};
a[0]=a[1]=true;
int rs=0;
for(int i=2;i<=n;i++){
if(a[i]==false)
rs++;
for(int j=i*2;j<=n;j+=i)
a[j]=true;
}
cout<<rs;
return 0;
}