Cod sursa(job #411254)

Utilizator v14dVlad Baesu v14d Data 4 martie 2010 19:50:25
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.38 kb
#include<fstream>
#include<math.h>
using namespace std;

int prim(long long nr)
{
    for(int i=2;i<sqrt(nr);++i) if(nr%i==0) return 0;
    return 1;
}

int main()
{
    long long n,s=0;
    ifstream fi("ciur.in");
    ofstream fo("ciur.out");
    fi>>n;
    for(int i=2;i<=n;++i) if(i%2!=0) if(prim(i)) s++;
    fo<<s;
    fi.close();
    fo.close();
return 0;
}