Pagini recente » Cod sursa (job #3270280) | Cod sursa (job #1222328) | Cod sursa (job #2177263) | Cod sursa (job #3263089) | Cod sursa (job #3244583)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n , k , st[20];
void Afis(int k)
{
for(int i = 1;i <= k;i++)
fout << st[i] << " ";
fout << "\n";
}
int Valid(int top)
{
if(top > k) return 0;
if(top > 1 and st[top - 1] >= st[top]) return 0;
return 1;
}
void Back(int top)
{
for(int i = 1;i <= n;i++)
{
st[top] = i;
if(Valid(top))
{
if(top == k) Afis(k);
Back(top + 1);
}
}
}
int main()
{
fin >> n >> k;
Back(1);
return 0;
}
/**
*/