Pagini recente » Cod sursa (job #2116980) | Cod sursa (job #1832645) | Cod sursa (job #1669958) | Cod sursa (job #2152466) | Cod sursa (job #3037572)
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
using namespace std;
#define file "combinari"
ifstream f(file + string(".in"));
ofstream g(file + string(".out"));
int x[9], n, m;
void afis(int k) {
for (int i = 1; i <= k; i++) g << x[i] << " ";
g << endl;
}
bool valid(int k) {
for (int i = 1; i < k; i++)
if (x[i] == x[k]) return 0;
if (k > 1)
if (x[k] <= x[k-1]) return 0;
return 1;
}
void back(int k) {
for (int i = 1; i <= n; i++) {
x[k] = i;
if (valid(k))
if (k == m) afis(k);
else back(k+1);
}
}
int main() {
f >> n >> m;
back(1);
return 0;
}