Pagini recente » Cod sursa (job #2299336) | Cod sursa (job #1274121) | Cod sursa (job #2721655) | Cod sursa (job #1735404) | Cod sursa (job #1914280)
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[19],b[19];
void back(int k,int len,int max)
{
if(k-1 == max)
{
for(int i = 1; i <= max;i++)
g<<a[i]<<" ";
g<<'\n';
}
else
{
for(int i = 1; i <= len; i++)
if(!b[i] && a[k-1] < i)
{
a[k] = i;
b[i] = 1;
back(k+1,len,max);
b[i] = 0;
}
}
}
int main()
{
int n,k;
f>>n>>k;
back(1,n,k);
return 0;
}