Cod sursa(job #1389267)

Utilizator sandi.florianFlorian Maria Alexandra sandi.florian Data 16 martie 2015 09:40:21
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.33 kb
Raporteaza aceasta sursa 
#include <iostream>
#include<fstream>
using namespace std;
int prim(int n)
{int ok=1;
for(int i=2;i<n/2;i++)
    if(n%i==0)
        ok=0;
return ok;
}

int main()
{
 ifstream f("ciur.in");
 ofstream g("ciur.out");
 int N,i=2,k=-1;
 f>>N;
 while(i<=N)
 {if(prim(i)==1)
    k++;
  i++;
 }
 g<<k;
    return 0;
}