Pagini recente » Cod sursa (job #2476917) | Cod sursa (job #1649260) | Cod sursa (job #2134538) | Cod sursa (job #2835288) | Cod sursa (job #214239)
Cod sursa(job #214239)
#include<fstream.h>
void back(long k);
int ok(long k);
long n,x[3],l=0;
long cmmdc(long a,long b);
int main()
{
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin>>n;
back(1);
fout<<l+1;
fin.close();
return 0;
}
void back(long k)
{
for (long i=1;i<=n;i++)
{
x[k]=i;
if (ok(k))
if (k==2)
l++;
else
back(k+1);
}
}
int ok(long k)
{
if (k==1) return 1;
if (x[2]==x[1]) return 0;
if (k==2)
if (cmmdc(x[k],x[k-1])!=1)
return 0;
return 1;
}
long cmmdc(long a,long b)
{
long r;
while (b!=0)
{
r=a%b;
a=b;
b=r;
}
return a;
}