Cod sursa(job #2525363)
Utilizator | Lazarov Robert Robysen | Data | 17 ianuarie 2020 10:57:30 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int a[19], b[19];
void Combine(int k, int len, int maxi){
if (k - 1 == maxi){
for(int i = 1; i <= maxi; i++)
fout << a[i] <<' ';
fout << '\n';
}
else
{
for(int i = 1; i <= len; i++)
if(!b[i] && a[k-1] < i)
{
a[k] = i;
b[i] = 1;
Combine(k+1, len, maxi);
b[i] = 0;
}
}
}
int main()
{
int n, k;
fin >> n >> k;
Combine(1, n, k);
}