Pagini recente » Cod sursa (job #3258212) | Cod sursa (job #1064649) | Cod sursa (job #2677800) | Cod sursa (job #1918277) | Cod sursa (job #1749513)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
int bt(int k);
int check(int k);
int check2(int k);
int show(int k);
int n, j, a[100];
int bt(int k)
{
int i;
for(i = 1; i <= n; ++ i)
{
a[k] = i;
if(check(k) == 1)
{
if(check2(k) == 1)
{
show(k);
}
else
{
bt(k + 1);
}
}
}
}
int check(int k)
{
int i;
for(i = 1; i <= k - 1; ++ i)
{
if(a[i] == a[k] || a[i] > a[i + 1])
{
return 0;
}
}
return 1;
}
int check2(int k)
{
if(k == j)
{
return 1;
}
else;
{
return 0;
}
}
int show(int k)
{
int i;
for(i = 1; i <= j; ++ i)
{
out << a[i] << " ";
}
out << "\n";
}
int main()
{
in >> n;
for(j = 1; j <= n; ++ j)
{
bt(1);
}
return 0;
}