Cod sursa(job #2664330)
| Utilizator | Data | 28 octombrie 2020 15:21:53 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
#define NMAX 20
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k;
bitset <NMAX> freq;
int v[NMAX];
void afisare()
{
for(int i = 0; i < k; i++)
g << v[i] << " ";
g << '\n';
}
void bkt(int p)
{
if(p == k)
afisare();
else
for(int i = 1; i <= n; i++)
if(freq[i] == 0 && i > v[p - 1])
{
freq[i] = 1;
v[p] = i;
bkt(p + 1);
freq[i] = 0;
}
}
int main()
{
f >> n >> k;
bkt(0);
return 0;
}
