Pagini recente » Cod sursa (job #2147146) | Cod sursa (job #1460906) | Cod sursa (job #375577) | Cod sursa (job #1264757) | Cod sursa (job #110846)
Cod sursa(job #110846)
#include <fstream.h>
#include <math.h>
#define NMAX 1000001
long baze[NMAX];
long long pow(long p,long e)
{ long i;
long long s=1;
for (i=1;i<=e;i++) s=s*p;
return s;
}
long prim(long x)
{ long i;
for (i=(long)(sqrt(x));i>=2;i--)
if (x%i==0)
return i;
return x;
}
int main()
{ long n,i,j,t[NMAX],x,p,e,a,c;
long long nr;
ifstream f("fractii.in");
f>>n;
f.close();
nr=1;
t[1]=1;
for (i=2;i<=n;i++)
{ x=prim(i);
if (x==i) p=i;
else p=baze[x];
baze[i]=p;
if (p==i) e=1;
else { a=i;e=0;
while (a%p==0)
{ e++;
a=a/p;
}
}
c=pow(p,e-1);
a=i/(c*p);
t[i]=(p-1)*c*t[a];
nr+=2*t[i];
}
ofstream g("fractii.out");
g<<nr;
g.close();
return 0;
}