Pagini recente » Cod sursa (job #190993) | Cod sursa (job #1940389) | Cod sursa (job #3203620) | Cod sursa (job #347823) | Cod sursa (job #712579)
Cod sursa(job #712579)
#include <fstream>
using namespace std;
int x[4], n, contor=1;
ifstream f("fractii.in");
ofstream g("fractii.out");
bool posibil()
{
if(x[1]==x[2])
return false;
return true;
}
int cmmdc(int a, int b)
{
int c=a%b;
while(c)
{
a=b;
b=c;
c=a%b;
}
return b;
}
void back(int k)
{
int i;
for(i=1; i<=n; i++)
{
x[k]=i;
if(k==2)
{
if(x[1]!=x[2] && cmmdc(x[1], x[2])==1)
{
contor++;
}
}
else back(k+1);
}
}
int main()
{
f>>n;
back(1);
g<<contor;
}