Pagini recente » Cod sursa (job #1539620) | Cod sursa (job #2038280) | Cod sursa (job #2687343) | Cod sursa (job #2489496) | Cod sursa (job #1848314)
#include <stdio.h>
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","w",stdin);
freopen("combinari.out","r",stdout);
scanf("%d%d",n,h);
explore(0,0);
return 0;
}