Cod sursa(job #1197655)
Utilizator | Data | 13 iunie 2014 09:14:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
int nr,i;
unsigned long long n;
ifstream f("ciur.in");
ofstream g("ciur.out");
int prim(int x)
{
for(int d=2;d<=x/2;d++)
if(x%d==0)
return 0;
return 1;
}
int main()
{
f>>n;
for(i=2;i<=n;i++)
if(prim(i)==1)
nr++;
g<<nr;
return 0;
}