Pagini recente » Cod sursa (job #2719181) | Cod sursa (job #2278495) | Cod sursa (job #2058767) | Cod sursa (job #177808) | Cod sursa (job #1007752)
#include <iostream>
#include <fstream>
#define maxn 17
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int a[maxn],k,n;
bool valid(int q)
{
for (int i=1;i<=q-1;i++)
{
if (a[q] == a[i])
return false;
}
return true;
}
void afisare()
{
for (int i=1;i<=k;i++)
g << a[i] << " ";
g << endl;
}
void back(int q)
{
for(int i=1;i<=k;i++)
{
a[q] = i;
if (valid(q))
{
if (q==k)
afisare();
else
back(q+1);
}
}
}
int main()
{
f >> n;
// for (int i=1;i<=n;i++)
// {
// k = i;
k = n;
int q = 1;
back(q);
// }
return 0;
}