Cod sursa(job #3033040)
Utilizator | Data | 23 martie 2023 11:30:35 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k, a[20];
void afiseasa(int i){
for(int j = 1; j <= i; j++)
g << a[j] << ' ';
g << '\n';
}
void backt(int i){
int j;
for(j = a[i-1]+1; j <= n; j++){
a[i] = j;
if(i == k)
afiseasa(k);
else
backt(i+1);
}
}
int main()
{
f >> n >> k;
backt(1);
return 0;
}