Cod sursa(job #3158763)
Utilizator | Data | 19 octombrie 2023 18:58:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int darab(int n){
int db=0;
for(int i=2;i<=n;i++){
int a=1;
for(int j=2;j<=i/2;j++){
if(i%j==0) a=0;
}
if(a==1) db++;
}
return db;
}
int main()
{
int n;
fin>>n;
fout<<darab(n);
return 0;
}