Pagini recente » Istoria paginii runda/sacou/clasament | Monitorul de evaluare | Istoria paginii runda/rar41 | Cod sursa (job #2372678) | Cod sursa (job #1678173)
#include <fstream>
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int n, sol[100], p;
bool app[100];
void display(int k)
{
for(int i = 1; i <= k; ++i)
{
fout << sol[i] << ' ';
}
fout << '\n';
}
void bkt(int k)
{
if(k == n+1)
{
return;
}
for(int i = 1; i <= n; ++i)
{
if(!app[i] && (k == 1 || i > sol[k-1]))
{
sol[k] = i;
app[i] = true;
display(k);
bkt(k+1);
app[i] = false;
}
}
}
int main()
{
fin >> n;
bkt(1);
return 0;
}