Cod sursa(job #162082)
Utilizator | Andrei-Bogdan Antonescu andrei-alpha | Data | 19 martie 2008 13:12:36 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
#define N 20
int n,k;
char sol[N];
void print()
{
for(int i=1;i<=k;++i)
printf("%d ", sol[i]);
printf("\n");
}
void back(int x)
{
if(x==k)
print();
else
for(int i=sol[x]+1;i<=n;++i)
{
sol[x+1]=i;
back(x+1);
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d", &n,&k);
back(0);
return 0;
}