Cod sursa(job #1848315)
| Utilizator | Data | 15 ianuarie 2017 20:21:42 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <stdio.h>
#include <iostream>
using namespace std;
int n ,h;
int sol[201];
bool vis[201];
void explore(int k ,int y) {
if(k == h) {
for(int i = 0; i < h; i++) {
printf("%d ",sol[i]);
}
printf("\n");
} else{
for(int i = y + 1; i <= n; i++) {
if(vis[i] == 0) {
sol[k] = i;
vis[i] = 1;
explore(k+1 ,i);
vis[i] = 0;
}
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&h);
explore(0,0);
return 0;
}
