Pagini recente » Cod sursa (job #2680734) | Cod sursa (job #2598328) | Cei mai harnici utilizatori info-arena | Cod sursa (job #2418209) | Cod sursa (job #2680735)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int n, p;
int sol[20], f[20];
void bt(int k, int ind)
{
if (k==p+1)
{
for (int i=1;i<=p;++i)
{
fout << f[i] << " ";
}
fout << "\n";
return;
}
for (int i=ind;i<=n;++i)
{
sol[i-1]=1;
if (!sol[i])
{
f[k]=i;
sol[i]=1;
bt(k+1,ind+1);
sol[i]=0;
}
sol[i-1]=0;
}
return;
}
int main()
{
fin >> n >> p;
bt(1,1);
return 0;
}