Pagini recente » Cod sursa (job #242309) | Cod sursa (job #2000175) | Cod sursa (job #240151) | Cod sursa (job #897736) | Cod sursa (job #1570180)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k, st[20];
void afisare(){
for(int i = 1 ; i <= k ; i++)
fout << st[i] << ' ';
fout << '\n';
}
void back(int p){
if(p == k + 1){
afisare();
return;
}
for(int i = st[p - 1] + 1 ; i <= n ; ++i)
{
st[p] = i;
back(p + 1);
}
}
int main()
{
fin >> n >> k;
back(1);
return 0;
}