Pagini recente » Cod sursa (job #1562518) | Cod sursa (job #1864683) | Cod sursa (job #1487241) | Cod sursa (job #949368) | Cod sursa (job #2090973)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int x[19];
int n, p;
bool valid(int k)
{
for(int i = 1; i < k; ++i)
if(x[k] == x[i])
return false;
if(x[k] <= x[k - 1])
return false;
return true;
}
void BK()
{
int k = 1;
while(k > 0) {
while(x[k] < n) {
x[k]++;
if(valid(k))
if(k == p) {
for(int i = 1; i <= p; ++i)
fout << x[i] << " ";
fout << '\n';
}
else {
k++;
x[k] = 0;
}
}
k--;
}
}
int main()
{
fin >> n >> p;
BK();
return 0;
}