Pagini recente » Monitorul de evaluare | Monitorul de evaluare | Cod sursa (job #738145) | Istoria paginii runda/meow2 | Cod sursa (job #1754328)
#include <stdio.h>
#include <stdlib.h>
int n,kk,a[100];
int valid(int k)
{
int ok=1;
if (k>=1)
if (a[k]<=a[k-1])
ok=0;
return(ok);
}
void print()
{
int i;
for (i=0; i<=kk-1; i++)
printf("%d ",a[i]);
printf("\n");
}
void bkt(int k)
{
int i;
for (i=1; i<=n; i++)
{
a[k]=i;
if (valid(k)==1)
if (k==kk-1)
print();
else
bkt(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&kk);
bkt(0);
return 0;
}