Cod sursa(job #694810)
| Utilizator | Data | 28 februarie 2012 01:46:45 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <cstdio>
#define NMAX 18
int sol[NMAX];
int n, k;
void back(int pas)
{
if(pas == k)
{
for(int i=0;i<k;++i)
{
printf("%d ", sol[i]);
}
printf("\n");
}
else
{
for(int j=sol[pas-1]+1;j<=n;++j)
{
sol[pas] = j;
back(pas+1);
}
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &n, &k);
back(0);
return 0;
}
