Pagini recente » Cod sursa (job #1070998) | Cod sursa (job #2203151) | Cod sursa (job #1735258) | Cod sursa (job #1048595) | Cod sursa (job #2119024)
#include <bits/stdc++.h>
using namespace std;
int n, m;
int v[10];
inline void back(int k, int j){
if(k == m){
for(int i = 0; i < m ; ++i)
printf("%d ", v[i]);
printf("\n");
return ;
}
for(int i = j + 1; i <= n ; ++i){
v[k] = i;
back(k + 1, i);
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d", &n, &m);
back(0, 0);
return 0;
}