Cod sursa(job #3041041)
Utilizator | Data | 30 martie 2023 21:01:52 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("data.in");
ofstream g("data.out");
int sol[100];
int n,a;
bool val[100];
void afis()
{
for (int i = 1; i <= a; i++)
{
g << sol[i] << ' ';
}
g << '\n';
}
bool valid(int k)
{
return !val[sol[k]] && sol[k] > sol[k - 1];
}
void backt(int k)
{
if (k == a+1)
{
afis();
return;
}
for (int i = 1; i <= n; i++)
{
sol[k] = i;
if (valid(k))
{
val[i] = 1;
backt(k + 1);
val[i] = 0;
}
}
}
int main()
{
f >> n >> a;
backt(1);
}