Pagini recente » Cod sursa (job #1977436) | Cod sursa (job #1258024) | Cod sursa (job #710776) | Cod sursa (job #1626078) | Cod sursa (job #1312452)
#include <iostream>
#include <cstdio>
using namespace std;
int n,k,v[20];
void afis()
{
for(int i=1; i<=k; i++)printf("%d ",v[i]);
printf("\n");
}
int valid(int pas)
{
for(int i=1; i<pas; i++)
if(v[i]==v[pas])return 0;
return 1;
}
void gen(int pas)
{
if(pas>k)afis();
else{
for(int i=v[pas-1]+1; i<=n; i++)
{v[pas]=i;
if(valid(pas))gen(pas+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
for(int i=1; i<=n; i++)
{v[1]=i; gen(2); }
return 0;
}