Pagini recente » Cod sursa (job #850095) | Cod sursa (job #1920428) | Cod sursa (job #3185518) | Cod sursa (job #1876164) | Cod sursa (job #1052874)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int N, M, sol[20];
void afis(){
int i;
for(i = 1; i <= M; i++){
out << sol[i] << " ";
}
out << "\n";
}
void backt(int k){
if(k == M + 1){
afis();
}else{
for(int i = sol[k - 1] + 1; i <= N; i++){
sol[k] = i;
backt(k + 1);
}
}
}
int main()
{
in >> N >> M;
backt(1);
return 0;
}