Pagini recente » Cod sursa (job #1008246) | Cod sursa (job #1009306) | Cod sursa (job #15769) | Cod sursa (job #20799) | Cod sursa (job #1829537)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
const int NMAX=18;
int n, nr=0, k;
int sol[NMAX];
bool ap[NMAX];
void print(int sol[]){
for(int i=0; i<k; i++){
fout<<sol[i]<<" ";
}
fout<<"\n";
return;
}
void bkt (int pos){
if(pos>=k){
print(sol);
nr++;
return;
}
for(int val=1; val<=n; ++val){
if(ap[val])
continue;
if(sol[pos-1]>val)
continue;
sol[pos]=val;
ap[val]=true;
bkt(pos+1);
sol[pos]=0;
ap[val]=false;
}
}
int main()
{
fin>>n>>k;
bkt(0);
return 0;
}