Pagini recente » Cod sursa (job #3205164) | Cod sursa (job #2062583) | Cod sursa (job #1797361) | Cod sursa (job #2503317) | Cod sursa (job #2089191)
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
const int N = 19;
int st[N],n,k;
bool viz[N];
void afis(int l){
for(int i=1;i<l;i++)
out<<st[i]<<" ";
out<<"\n";
}
void bkt(int l){
if(l == k+1)
afis(l);
else
for(int i=1;i<=n;i++)
if(viz[i] == false){
viz[i] = true;
st[l] = i;
if(i > st[l-1])
bkt(l+1);
viz[i] = false;
}
}
int main()
{
in>>n>>k;
in.close();
bkt(1);
out.close();
return 0;
}