Pagini recente » Cod sursa (job #312361) | Cod sursa (job #795047) | Cod sursa (job #3275995) | Cod sursa (job #2091055) | Cod sursa (job #1820786)
#include <fstream>
using namespace std;
int st[15],fv[20],n,ams,ev,k;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int valid(int niv)
{
if (st[niv]<=st[niv-1])
return 0;
else return 1;
}
void backtr(int niv)
{
if(niv==k+1)
{
int i;
for(i = 1; i <niv; i++)
fout<<st[i]<<" ";
fout<<'\n';
}
else
for(int i=1; i<= n; i++)
if(fv[i]==0)
{
fv[i]=1;
st[niv]=i;
if(valid(niv)==1)
{
backtr(niv+1);
}
fv[i]=0;
}
}
int main()
{
fin>>n>>k;
backtr(1);
fin.close();
fout.close();
return 0;
}