Cod sursa(job #868547)
Utilizator | Data | 31 ianuarie 2013 10:57:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
long int N,i=3,a=1;
long int prim(long int nr)
{
int j,ok;
for (j=3;j<=nr/2;j++)
if (nr%j==0) return 0;
return 1;
}
int main()
{
f>>N;
for (i=3;i<=N;i+=2)
if (prim(i)==1) a++;
cout<<a;
return 0;
}