Cod sursa(job #654131)
| Utilizator | Data | 29 decembrie 2011 17:25:13 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
int a[19],n,k;
void afisare(){
int i;
for (i=1;i<=k;i++)
printf("%d ", a[i]);
printf("\n");
}
void back(int lung){
for (int i=a[lung-1]+1;i<=n;i++){
a[lung]=i;
if (lung==k)
afisare();
back(lung+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d", &n, &k);
back(1);
return 0;
}