Pagini recente » Cod sursa (job #1719638) | Monitorul de evaluare | Cod sursa (job #2972864) | Cod sursa (job #1983346) | Cod sursa (job #2131672)
#include <iostream>
#include <fstream>
using namespace std;
int a[100],b[100];
ifstream f("combinari.in");
ofstream g("combinari.out");
void back(int k,int m,int l)
{
if(k-1 == l)
{
int ok = 1;
for(int i = 1;i < l;i++)
{
if(a[i] > a[i+1])
{
ok = 0;
break;
}
}
if(ok)
{
for(int i = 1;i <= l;i++)
{
g<<a[i]<<" ";
}
g<<endl;
}
}
else
{
for(int i = 1;i <= m;i++)
{
if(b[i] == 0)
{
a[k] = i;
b[i] = 1;
back(k+1,m,l);
b[i]=0;
}
}
}
}
int main()
{
int m,n;
f>>m>>n;
back(1,m,n);
return 0;
}