Pagini recente » Istoria paginii utilizator/teodoraxinte | Cod sursa (job #734525) | Clasament Seniori | Istoria paginii utilizator/ewaru | Cod sursa (job #256225)
Cod sursa(job #256225)
#include <stdio.h>
int st[9],n,p;
void afis(int k)
{
int i;
for (i=1;i<=k;i++)
printf("%d ", st[i]);
printf("\n");
}
int valid(int k)
{
int i;
for (i=1;i<k;i++)
if (st[i]==st[k])
return 0;
return 1;
}
void back(int k)
{
int x;
for (x=st[k]-1;x<=n;x++)
{
st[k]=x;
if (st[k]>st[k-1])
if (valid(k))
if (k==p)
afis(k);
else
back(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d", &n, &p);
back(1);
return 0;
}