Pagini recente » Cod sursa (job #2146187) | Cod sursa (job #1429444) | Cod sursa (job #3260476) | Cod sursa (job #2049339) | Cod sursa (job #107461)
Cod sursa(job #107461)
#include <fstream.h>
int prim[1000];
long long erast (long long x)
{ long long nr,i,j;
for (i=1;i<=x;i++) prim[i]=0;
for (i=2;i<x;i++)
if (x%i==0)
{ for (j=i;j<=x;j=j+i)
prim[j]=1;
}
nr=0;
for (i=1;i<x;i++)
if (prim[i]==0) nr++;
return nr;
}
int main()
{ long long n,i,j,nr;
ifstream f("fractii.in");
f>>n;
f.close();
nr=1;
for (i=2;i<=n;i++)
nr+=2*erast(i);
ofstream g("fractii.out");
g<<nr;
g.close();
return 0;
}