Cod sursa(job #1533022)
Utilizator | Data | 21 noiembrie 2015 22:29:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
#include<iostream>
#include<math.h>
using namespace std;
double divizor(int a){
if(a%2==0) return false;
for(int i=3;i<sqrt(a);i+=2)
if(a%i==0) return false;
return true;
}
int main(){
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
//cout<<n;
int aux=0;
while(n>=2){
if(divizor(n)==true)
aux++;
n--;
}
g<<aux;
f.close();
g.close();
}