Pagini recente » Cod sursa (job #3128664) | Cod sursa (job #476983) | Cod sursa (job #222186) | Cod sursa (job #2247272) | Cod sursa (job #2028068)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k;
int a[18];
int st[18];
void Afisare()
{
int i;
for(i = 1; i <= k; i++)
fout << st[i] << " ";
fout << "\n";
}
inline bool Valid(int top)
{
int i;
for(i = 1; i < top; i++)
if(st[top] == st[i])
return 0;
return 1;
}
void Back()
{
int cand, top = 1;
st[top] = 0;
while(top > 0)
{
cand = 0;
while(cand == 0 && st[top] < n)
{
st[top]++;
cand = Valid(top);
}
if(cand == 0)
top--;
else if(top == k)
Afisare();
else
{
top++;
st[top] = st[top - 1];
}
}
}
int main()
{
fin >> n >> k;
Back();
return 0;
}