Cod sursa(job #1010677)
| Utilizator | Data | 15 octombrie 2013 13:36:58 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<iostream>
#include<fstream>
using namespace std;
bool ePrim(int n){
if(n>1){
for(int i=2;i<=n/2;i++){
if(n%i==0){
return false;
}
}
}
return true;
}
int main(){
ifstream f("ciur.in");
ofstream o("ciur.out");
int n=0;
f>>n;
int nrPrime=0;
for(int i=2;i<=n;i++){
if(ePrim(i)){
nrPrime++;
}
}
o<<nrPrime;
return 0;
}