Cod sursa(job #1469313)
Utilizator | Data | 8 august 2015 00:21:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int prim(long x)
{long i;
for(i=2;i*i<=x;i++)
if(x%i==0)
return 0;
return 1;
}
int main()
{long n,i,nr=0;
fin>>n;
for(i=2;i<=n;i++)
if(prim(i)==1)
nr++;
fout<<nr;
return 0;
}