Pagini recente » Cod sursa (job #2535993) | Cod sursa (job #2757888) | Cod sursa (job #820461) | Cod sursa (job #2355756) | Cod sursa (job #1975967)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int n,k,nrf,a[19];
void combinari(int nr){
if(nr<n){
for(a[nr]=1;a[nr]>=0;a[nr]--){
if(a[nr])nrf++;
else nrf--;
combinari(nr+1);
}
} else {
for(a[nr]=1;a[nr]>=0;a[nr]--)
if(nrf+a[nr]==k){
for(int i=1;i<=n;i++)
if(a[i])g<<i<<" ";
g<<'\n';
}
}
}
int main()
{
f>>n>>k;
combinari(1);
f.close ();
g.close ();
return 0;
}