Cod sursa(job #2028080)
Utilizator | Data | 27 septembrie 2017 09:44:20 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
using namespace std;
int perm[19],fol[19],n,k;
void afis(int n)
{
for(int i=1;i<=n;i++)
cout<<perm[i]<<" ";
cout<<endl;
}
void bact(int pas)
{
int i;
if(pas>k)
afis(k);
else
{
for(i=perm[pas-1]+1;i<=n;++i)
{
perm[pas]=i;
bact(pas+1);
}
}
}
int main()
{
cin>>n>>k;
bact(1);
return 0;
}