Pagini recente » Cod sursa (job #1885362) | Cod sursa (job #2492656) | Cod sursa (job #328527) | Cod sursa (job #2267885) | Cod sursa (job #1539553)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int st[2], n, nr = 0;
bool valid()
{
if (st[0] > st[1])
{
if (st[1] == 1)
{
return 1;
}
if (st[0] % st[1] == 0)
{
return 0;
}
}
else if (st[0] < st[1])
{
if (st[0] == 1)
{
return 1;
}
if (st[1] % st[0] == 0)
{
return 0;
}
}
else
{
if (st[0] == 1)
{
return 1;
}
else
{
return 0;
}
}
}
/*void afisare()
{
for (int i = 0; i <= 1; i++)
{
cout << st[i] << " ";
}
cout << '\n';
}*/
void back(int k)
{
for (int i = 1; i <= n; i++)
{
st[k] = i;
if (k == 1)
{
if (valid())
{
nr++;
//afisare();
}
}
else
{
back(k + 1);
}
}
}
int main()
{
f >> n;
back(0);
g << nr;
return 0;
}