Pagini recente » Cod sursa (job #93104) | Cod sursa (job #2837404) | Cod sursa (job #1023450) | Cod sursa (job #1725010) | Cod sursa (job #1738977)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,i,x[100],viz[100];
bool ok;
int cont(int p)
{
return 1;
}
int solutie(int p)
{
if(p==k)
return 1;
return 0;
}
int afis(int p)
{
ok=0;
for(int i=1;i<p;i++)
if(x[i]>x[i+1])
{ok=1;break;}
if(ok==0)
{for(int i=1;i<=p;i++)
fout<<x[i]<<" ";
fout<<endl;}
}
void back(int p)
{
for(int i=1;i<=n;i++)
if(!viz[i])
{
x[p]=i;
viz[i]=1;
if(cont(p))
if(solutie(p))afis(p);
else
back(p+1);
viz[i]=0;
}
}
int main()
{
fin>>n>>k;
back(1);
}