Pagini recente » Cod sursa (job #154264) | Cod sursa (job #159870) | Cod sursa (job #1953543) | Cod sursa (job #2860751) | Cod sursa (job #1295550)
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
int fct(int n)
{
int result = n;
for(int i=2;i*i <= n;i++)
{
if (n % i == 0) result -= result / i;
while (n % i == 0) n /= i;
}
if (n > 1) result -= result / n;
return result;
}
bool prim(int x)
{
for(int d=2;d<=sqrt(x);d++)
if(x%d==0)
return 0;
return 1;
}
int main()
{
int n,nr=1;
ifstream fin("fractii.in");
fin>>n;
ofstream fout("fractii.out");
nr+=2*(n-1);
for(int a=2;a<n;a++)
{
double x=0;
x=(n-a+1)*1.0*fct(a)/a;
x=floor(x);
//cout<<a<<" "<<x<<endl;
nr+=2*x;
}
fout<<nr;
}