Cod sursa(job #3285811)
Utilizator | Data | 13 martie 2025 14:50:29 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, fr[20], st[20];
void Afis()
{
int i;
for (i = 1 ; i <= k ; i++)
fout << st[i] << " ";
fout << "\n";
}
void Back(int top)
{
int i;
if (top == k + 1)
Afis();
else for (i = st[top - 1] + 1 ; i <= n ; i++)
if (fr[i] == 0)
{
fr[i] = 1;
st[top] = i;
Back(top + 1);
fr[i] = 0;
}
}
int main()
{
int i;
fin >> n >> k;
Back(1);
return 0;
}