Cod sursa(job #228109)
Utilizator | Data | 6 decembrie 2008 14:48:08 | |
---|---|---|---|
Problema | Combinari | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<stdio.h>
#define nmax 18
int st[nmax],n,m;
void back(int);
void printsir();
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back(1);
return 0;
}
void back(int k)
{
for(int i=1;i<=n;++i)
{
st[k]=i;
if (st[k-1]<st[k])
{
if (k==m) printsir();
back(k+1);
}
}
}
void printsir()
{
for(int i=1;i<=m;++i)
printf("%d ",st[i]);
printf("\n");
}