Cod sursa(job #1704944)
Utilizator | Data | 19 mai 2016 17:26:20 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
using namespace std;
int n,a[100], fol[100],k,x;
void afisare(int p)
{
if(p>k)
{
for(int i=1;i<=k;++i)cout<<a[i]<<" ";
cout<<'\n';
return;
}
for(int l=a[p-1]+1;l<=n;++l)
{
if(fol[l]==0)
{
a[p]=l;
fol[l]++;
afisare(p+1);
fol[l]--;
}
}
}
int main()
{
cin>>n>>k;
afisare(1);
return 0;
}