Cod sursa(job #155946)
Utilizator | Gigea Victor victorgigea | Data | 12 martie 2008 11:42:06 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
#define FIN "combinari.in"
#define FOUT "combinari.out"
int s[19],n,k;
void print()
{int i;
for(i=1;i<=k;i++)
printf("%d ",s[i]);
printf("\n");
}
void back(int p)
{
int i;
for(i=1;i<=n-k+1;i++)
{
s[p]=s[p-1]+i;
if(s[p]>n) break;
if(p==k) print();
else back(p+1);
}
}
int main()
{
freopen(FIN,"rt",stdin);
freopen(FOUT,"wt",stdout);
scanf("%d%d",&n,&k);
back(1);
return 0;
}