Pagini recente » Cod sursa (job #2121887) | Cod sursa (job #1875790) | Cod sursa (job #630280) | Cod sursa (job #1821004) | Cod sursa (job #3214911)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
using pii = pair<int,int>;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n , k , conf[20];
void comb(int x)
{
if(x == k)
{
for(int j = conf[x-1] + 1 ; j <= n ; ++j)
{
for(int i = 1 ; i < k ; ++i) cout << conf[i] << ' ';
cout << j;
cout << '\n';
}
return;
}
for(int i = conf[x-1] + 1 ; i <= n ; ++i)
{
conf[x] = i;
comb(x+1);
}
}
signed main()
{
cin >> n >> k;
comb(1);
return 0;
}