Cod sursa(job #3189505)
| Utilizator | Data | 5 ianuarie 2024 22:15:13 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int j,i,k=0;
bool a[2000001];
int main() {
int n;
cin>>n;
for(i=2;i<=n;i++){a[i]=true;}
for(i=2;i*i<=sqrt(n);i++){
if(a[i]==true){
for(j=i*i;j<n;j+=i){
a[j]=false;}}}
for(i=2;i<=n;i++){
if(a[i]==true) k++;}
cout<<k<<endl;
return 0;
}
