Cod sursa(job #1539540)
| Utilizator | Data | 30 noiembrie 2015 23:07:53 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <iostream>
using namespace std;
int st[2], n, nr = 0;
bool valid()
{
if (((st[0] % st[1] == 0) || (st[1] % st[0] == 0)) && (st[0] != 1) && (st[1] != 1))
{
return 0;
}
else
{
return 1;
}
}
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);
}
}
}
void main()
{
n = 10;
back(0);
cout << nr;
}