Pagini recente » Cod sursa (job #1287618) | Cod sursa (job #879842) | Cod sursa (job #1086192) | Rating Armando Popescu (GianiTeroare) | Cod sursa (job #1110567)
#include <stdio.h>
#include <math.h>
long long gcd(long long a,long long b)
{
long long r;
while(r=a%b)
{
a=b;
b=r;
}
return b;
}
long long phi(long long n)
{
long long i,s=0;
for(i=1;i<n;++i)
{
if(gcd(i,n)==1)
++s;
}
return s;
}
long long farey(long long n)
{
if(n==1)return 2;
else return farey(n-1)+phi(n);
}
int main()
{
long long n,m;
double pi;
pi=3.141593;
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%lld",&n);
if(n<10000)
printf("%lld",2*farey(n)-3);
else
m=(long long)(3*n*n/(pi*pi));
printf("%lld",2*m-3);
return 0;
}