Cod sursa(job #156767)
Utilizator | Data | 12 martie 2008 18:53:33 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
int n,k,st[18];
void back(int j)
{
int i;
if (j==k)
{
for (i=0;i<k;i++)
printf("%d ",st[i]);
printf("\n");
}
else
for (i=st[j-1]+1;i<=n+j-k+1;i++)
{
st[j]=i;
back(j+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
int i;
for (i=1;i<=n-k+1;i++)
{
st[0]=i;
back(1);
}
return 0;
}