Pagini recente » Cod sursa (job #2345007) | Cod sursa (job #3174962) | Cod sursa (job #3165202) | Cod sursa (job #2095565) | Cod sursa (job #2559654)
#include <fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int main() {
register int k = 1, n, m, sol[20];
bool as, ev;
sol[1] = 0;
cin >> n >> m;
while(k) {
do {
as = 0;
if(sol[k] < n) {
sol[k]++;
as = 1;
}
if(as) {
ev = 1;
for(int i = 1; i < k; ++i)
if(sol[i] >= sol[k])
ev = 0;
}
} while(as && !ev);
if(as)
if(k == m) {
for(int i = 1; i <= m; ++i)
cout << sol[i] << ' ';
cout << '\n';
}
else {
++k;
sol[k] = 0;
}
else
--k;
}
}