Cod sursa(job #550543)

Utilizator deadsleeperBanuc Vasilica Angel deadsleeper Data 9 martie 2011 18:44:19
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.36 kb
Raporteaza aceasta sursa 
#include <fstream>
#include <math.h>

using namespace std;


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


int main()
{

ifstream f("ciur.in");
ofstream g("ciur.out");
       
long int i,n,S=0;

f>>n;

for (i=2;i<=n;i++) S += prim(i);

g<<S;

f.close();
g.close();    
}