Cod sursa(job #3193182)
| Utilizator | Data | 14 ianuarie 2024 12:48:59 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
#define MAXN 18
int a[MAXN+1], b[MAXN+1];
void back(int k,int kk,int kmax) {
if(k-1==kmax) {
for(int i=1; i<=kmax; i++)
cout<<a[i]<<" ";
cout<<"\n";
} else {
for(int i=1; i<=kk; i++)
if(!b[i] && a[k-1]<i) {
a[k]=i;
b[i]=1;
back(k+1,kk,kmax);
b[i]=0;
}
}
}
int main() {
int n,k;
cin>>n>>k;
back(1,n,k);
return 0;
}
