Pagini recente » Cod sursa (job #2693307) | Cod sursa (job #1884469) | Cod sursa (job #297895) | Cod sursa (job #448271) | Cod sursa (job #444993)
Cod sursa(job #444993)
#include <iostream>
using namespace std;
int main(void) {
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
int n,m,k=1,i;
bool jo;
cin >> n >> m;
int v[m];
v[k]=0;
while (k>0) {
do {
v[k]++;
jo=true;
for (i=1;i<k;i++)
if (v[i]>=v[k]) jo=false;
}while (!(jo || v[k]==n+1));
if (jo && v[k]<=n) {
if (k==m) {
for (i=1;i<=m;i++)
cout << v[i] << " ";
cout << endl;
}else {
k++;
v[k]=0;
}
}else k--;
}
}