Pagini recente » Cod sursa (job #2845773) | Cod sursa (job #2528423) | Cod sursa (job #2766439) | Cod sursa (job #2763296) | Cod sursa (job #1905756)
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
const int nmax=18;
int n,k;
int v[nmax+1], u[nmax+1];
void bt(int x)
{
if(x>k)
{
for(int i=1; i<=k; i++)
{
out<<v[i]<<" ";
}
out<<"\n";
}
else
{
for(int i=v[x-1]+1; i<=n; i++)
{
if ( u[i] == 0 ) {
v[x]=i;
u[i] = 1;
bt(x+1);
u[i] = 0;
}
}
}
}
int main()
{
in>>n>>k;
bt(1);
return 0;
}