Pagini recente » Cod sursa (job #365857) | Cod sursa (job #1070905) | Cod sursa (job #204507) | Cod sursa (job #1053176) | Cod sursa (job #1594751)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, p, v[20];
void bk(int k);
void write(){
for (int i = 1; i <= p; i++)
fout << v[i] << " ";
fout << '\n';
}
bool check(int k){
for (int i = 1; i <= k - 1; i++)
if (v[i] == v[k]) return 0;
if (v[k] < v[k - 1]) return 0;
return 1;
}
bool valid(int k){
if (k == p) return 1;
return 0;
}
void bk(int k){
for (int i = 1; i <= n; i++){
v[k] = i;
if (check(k)){
if (valid(k))
write();
else
bk(k + 1);
}
}
}
int main()
{
fin >> n >> p;
bk(1);
return 0;
}