Cod sursa(job #256303)
Utilizator | Vlad Schnakovszki shnako | Data | 11 februarie 2009 15:33:37 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <stdio.h>
int n, x, k, st[20];
void tip(void)
{
for (register int j=1;j<=x;j++)
printf("%d ", st[j]);
printf("\n");
}
int valid (int k)
{
for (register int j=1;j<k;j++)
if (st[k]<=st[j])
return 0;
return 1;
}
void back(int k)
{
for (int i=1;i<=n;i++)
{
st[k]=i;
if (valid(k))
if (k==x)
tip();
else
back(k+1);
}
}
int main(void)
{
freopen ("combinari.in", "r", stdin);
freopen ("combinari.out", "w", stdout);
scanf("%d%d", &n, &x);
back(1);
return 0;
}