Pagini recente » Cod sursa (job #3201104) | Cod sursa (job #4474) | Cod sursa (job #2563385) | Cod sursa (job #1359892) | Cod sursa (job #3204864)
//combinari defapt
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, k, f[20], v[20];
void display(int p)
{
for(int i=1; i<=p; i++)
{
out<<v[i]<<' ';
}
out<<'\n';
}
void bkt(int p, int last)
{
for(int i=1; i<=n; i++)
{
if(f[i]==0 && i>last)
{
v[p]=i;
f[i]=1;
if(p==k)
{
display(p);
}
bkt(p+1, i);
f[i]=0;
}
}
}
int main()
{
in>>n>>k;//de n luate cate p..
bkt(1, 0);
}