Pagini recente » Borderou de evaluare (job #313612) | Cod sursa (job #439423) | Cod sursa (job #1030161) | Cod sursa (job #1000735) | Cod sursa (job #1208908)
#include <iostream>
#include <fstream>
using namespace std;
int fol[100], rez[100];
void Combinari(int n, int k, int poz, int uc){
if(poz > k){
for(int i = 1 ; i < poz ; ++i)
g<<rez[i]<<" ";
g<<"\n";
return;
}
for(int i = uc + 1 ; i <= n ; ++i){
rez[poz] = i;
Combinari(n , k , poz + 1, i);
}
}
int main()
{
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k;
f>>n;
f>>k;
Combinari(n , k , 1, 0);
return 0;
}