Pagini recente » Cod sursa (job #3135463) | Cod sursa (job #2805986) | Cod sursa (job #2575067) | Cod sursa (job #119679) | Cod sursa (job #2503762)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k;
int sir[20];
void gen(int lg)
{
if(lg == k + 1){
for(int j = 1; j <= k; j++)
fout << sir[j] << " ";
fout << "\n";
return;
}
for(int i = sir[lg - 1] + 1; i <= n; i++){
sir[lg] = i;
gen(lg + 1);
}
}
int main()
{
fin >> n >> k;
gen(1);
return 0;
}