Pagini recente » Cod sursa (job #3212585) | Cod sursa (job #2213361) | Cod sursa (job #3205501) | Cod sursa (job #2459083) | Cod sursa (job #2431945)
#include <fstream>
using namespace std;
long long d, v[40], i, n, sol;
int fi(int n)
{
int d=2, dim=0, prod1=1, prod2=1, aux=n;
while (n>1)
{
int p=0;
while (n%d==0)
{
++p;
n/=d;
}
if (p)
v[++dim]=d;
++d;
if (n>1 && d>n/d)
d=n;
}
for (int i=1; i<=dim; i++)
prod1*=(v[i]-1);
for (int i=1; i<=dim; i++)
prod2*=v[i];
int rez=(aux/prod2)*prod1;
return rez;
}
int main ()
{
ifstream fin ("fractii.in");
ofstream fout ("fractii.out");
fin>>n;
for (i=2; i<=n; i++)
sol+=2*fi(i);
sol++;
fout<<sol;
}