Pagini recente » Cod sursa (job #2708486) | Cod sursa (job #1933493) | Cod sursa (job #1742560) | Cod sursa (job #554833) | Cod sursa (job #2702164)
#include <fstream>
using namespace std;
ofstream g;
int n, nr;
int p[20];
int comb[20];
void afiseaza() {
int i;
for (i = 1; i <= nr; i++)
g << comb[i] << ' ';
g << '\n';
}
void back(int k) {
int i;
for (i = comb[k - 1] + 1; i <= n; i++)
if (!p[i]) {
p[i] = 1;
comb[k] = i;
if (k == nr)
afiseaza();
else back(k + 1);
p[i] = 0;
}
}
int main() {
ifstream f("combinari.in");
f >> n >> nr;
f.close();
g.open("combinari.out");
back(1);
g.close();
return 0;
}