Pagini recente » Cod sursa (job #2362027) | Cod sursa (job #552535) | Cod sursa (job #1378818) | Cod sursa (job #1436538) | Cod sursa (job #1367880)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k;
int v[20];
void show(){
for(int i = 1; i <= k; i++){
g << v[i] << " ";
}
g << "\n";
}
void bak(int x){
if(x > k){
return ;
} else {
for(int i = v[x - 1] + 1; i <= n; i++){
v[x] = i;
if(x == k){
show();
}
bak(x + 1);
}
}
}
int main()
{
f >> n >> k;
bak(1);
return 0;
}