Pagini recente » Cod sursa (job #3178384) | Cod sursa (job #497932) | Cod sursa (job #2204425) | Cod sursa (job #1997227) | Cod sursa (job #2436387)
#include <bits/stdc++.h>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int v[20],k,n,m,aux[20];
bool valid(int k) {
for(int i=1;i<k;i++)
if(v[i]==v[k] || v[k]>v[i])
return 0;
return 1;
}
void afisare() {
for(int i=1;i<=m;i++)
aux[i]=v[i];
sort(aux+1,aux+1+m);
for(int i=1;i<=m;i++)
out<<aux[i]<<" ";
out<<'\n';
}
int bt(int k)
{
for(int i=1;i<=n;i++) {
v[k]=i;
if(valid(k)) {
if(k==m)
afisare();
else
bt(k+1);
}
}
}
int main() {
in>>n>>m;
bt(1);
}