Cod sursa(job #881170)
Utilizator | Data | 17 februarie 2013 19:23:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,cifra=1,nr,m;
int prim (int x)
{
int prim=1;
for(int i=1;i<=x/2;i++)
if (x%i==0) cifra=0;
return cifra;
}
int main()
{
fin>>n;
for (m=3;m<=n;m+=2) if (prim (n)!=1) nr++;
fout<<nr;
fout.close();
return 0;
}