Cod sursa(job #160655)
| Utilizator | Data | 16 martie 2008 15:07:28 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
#define N 30
int n,k,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;
}
