Pagini recente » Cod sursa (job #2000800) | Cod sursa (job #2674385) | Cod sursa (job #205571) | Cod sursa (job #218217) | Cod sursa (job #199934)
Cod sursa(job #199934)
#include<stdio.h>
#include<math.h>
long long i, j, l, n, a, k, suma;
double p;
long long prim(long long a)
{ for(l=2;l*l<=a;l++)
if(a%l==0)
return 0;
return 1;
}
long long phi(long long nr)
{ p=nr;
if(prim(nr)==1)
return nr-1;
for(j=2;j*2<=nr;j++)
{// k=0;
if(prim(j)==1 && nr%j==0)
{ //long long aux=nr;
//while(aux%j==0)
// { k++; aux=aux/j; }
p=p*(float)(1-(float)1/j);
// p=p*(j-1)*pow(j, k-1);
}
}
return p;
}
int main()
{
freopen("fractii.in", "r", stdin);
freopen("fractii.out", "w", stdout);
scanf("%lld", &n);
for(i=2;i<=n;i++)
suma=suma+phi(i);
printf("%lld \n", 2*suma+1);
return 0;
}