Cod sursa(job #153854)
| Utilizator | Data | 10 martie 2008 19:33:36 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
int a[32];
int n, K;
inline void afis()
{
for(int i=1;i<=K;++i)printf("%d ", a[i]);
printf("\n");
}
inline void back(int k)
{
if(k==K+1)afis();
else
{
for(int i=a[k-1]+1;i<=n;++i)
{
a[k]=i;
back(k+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d\n", &n, &K);
back(1);
return 0;
}
