Pagini recente » Cod sursa (job #2863257) | Cod sursa (job #384999) | Cod sursa (job #2624993) | Cod sursa (job #669910) | Cod sursa (job #2027378)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,fol[100],comb[100];
void afisare()
{
int i;
for(i=1;i<=k;i++)
g<<comb[i]<<" ";
g<<"\n";
}
void back(int pas)
{
int i;
if(pas>k)
afisare();
else{
for(i=1;i<=n;i++)
{
if(comb[pas-1]<i && !fol[i])
{
comb[pas]=i;
fol[i]=1;
back(pas+1);
fol[i]=0;
}
}
}
}
int main ()
{
f>>n>>k;
back(1);
}