Pagini recente » Cod sursa (job #429592) | Cod sursa (job #612221) | Cod sursa (job #1203231) | Cod sursa (job #1951795) | Cod sursa (job #2503737)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k;
int sir[20];
bool isOk(int sir[20])
{
for(int i = 2; i <= k; i++)
if(sir[i] <= sir[i-1])
return false;
return true;
}
void gen(int cif, int lg)
{
if(lg == k + 1 && isOk(sir)){
for(int j = 1; j <= k; j++)
cout << sir[j] << " ";
cout << "\n";
return;
}
for(int i = cif; i <= n; i++){
sir[lg] = i;
gen(cif + 1, lg + 1);
}
}
int main()
{
fin >> n >> k;
gen(1,1);
return 0;
}