Cod sursa(job #315414)
Utilizator | Data | 15 mai 2009 16:09:01 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include<stdio.h>
int n,k;
int st[10];
void read()
{
scanf("%d%d",&n,&k);
}
void print()
{
int i;
for (i=1;i<=k;i++)
{
printf("%d ",st[i]);
}
printf("\n");
}
void back(int m)
{
int i;
if (m==k+1)
{
print();
}
else
for (i=st[m-1]+1;i<=n-(k-m);i++)
{
st[m]=i;
back(m+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
read();
back(1);
return 0;
}