Cod sursa(job #3303333)
| Utilizator | Data | 15 iulie 2025 11:21:56 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n;
int k;
int a[100];
int used[100];
void print(int j)
{
for (int i = 0; i <= j; i++)
{
fout << a[i] << ' ';
}
fout << '\n';
}
void dfs(int i, int p)
{
if (i == k) {print(i - 1); return;}
for (int x = 1; x <= n; x++)
{
if (!used[x] && x > p)
{
used[x] = 1;
a[i] = x;
//print(i);
dfs(i + 1, x);
used[x] = 0;
}
}
}
int main()
{
fin >> n >> k;
dfs(0, 0);
}
