Cod sursa(job #3182224)
| Utilizator | Data | 8 decembrie 2023 18:43:59 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#define NMAX 2000000
using namespace std;
char c[2000005];
int ciur(int n){
c[0] = c[1] = 1;
int cate = 0;
for(int i = 2 ; i <= n;i++){
if(!c[i]){
cate++;
for(int j = i + i;j <=n;j+=i){
c[j] = 1;
}
}
}
return cate;
}
int main(){
int n;
ifstream cin("ciur.in");
cin>>n;
cin.close();
ofstream cout("ciur.out");
cout<<ciur(n)<<"\n";
cout.close();
return 0;
}
