Pagini recente » Cod sursa (job #70650) | Cod sursa (job #1547357) | Cod sursa (job #2223690) | Cod sursa (job #1646694) | Cod sursa (job #2032850)
#include <fstream>
#define in "combinari.in"
#define out "combinari.out"
#define N 20
using namespace std;
ifstream fin(in);
ofstream fout(out);
int sol[N],n,k;
bool f[N];
inline void afis()
{
for(int i=1; i<=k; ++i)
fout<<sol[i]<<" ";
fout<<"\n";
}
inline void BK(const int &pas)
{
if(pas >= k)
afis();
else
{
for(int i = sol[pas] + 1; i<=n; ++i)
if(!f[i])
{
f[i] = 1;
sol[pas+1] = i;
BK(pas+1);
f[i] = 0;
}
}
}
int main()
{
fin>>n>>k;
BK(0);
fin.close(); fout.close();
return 0;
}