Pagini recente » Cod sursa (job #368480) | Cod sursa (job #1889406) | Cod sursa (job #3207921) | Cod sursa (job #530860) | Cod sursa (job #1680762)
#include <fstream>
using namespace std;
int a[19],b[19];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int back(int k,int c,int max)
{
int i;
if(k-1 == max)
{
for( i = 1; i <= max; i++)
fout<<a[i]<<" ";
fout<<"\n";
}
else
{
for(int i = 1; i <= c; i++)
if(!b[i] && a[k-1] < i)
{
a[k] = i;
b[i] = 1;
back(k+1,c,max);
b[i] = 0;
}
}
}
int main()
{
int n,k;
fin>>n>>k;
back(1,n,k);
return 0;
}