Pagini recente » Cod sursa (job #2887872) | Cod sursa (job #879479) | Cod sursa (job #35245) | Borderou de evaluare (job #366921) | Cod sursa (job #1797859)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int folosit[19];
int p,k,n,ok;
int v[20];
void back(int p)
{
if(p==k+1)
{
if(v[1]<=n-k+1)
{
ok=1;
for(int i=1;i<k;i++)
{
if(v[i]>v[i+1])
ok=0;
}
}
if(ok)
{for(int i=1;i<=k;i++)
fout<<v[i]<<" ";
fout<<'\n';}
return;
}
for(int i=1;i<=n;i++)
{
if(folosit[i]==0)
{
v[p]=i;
folosit[i]=1;
back(p+1);
folosit[i]=0;
}
}
}
int main()
{
fin>>n>>k;
back(1);
return 0;
}