Cod sursa(job #158197)
| Utilizator | Data | 13 martie 2008 15:18:17 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
#define NMAX 20
int v[NMAX],n,k;
void wtf(int p, int l)
{
int i;
if (p==k)
{
for (i=0; i<k-1; i++)
printf("%d ",v[i]);
printf("%d\n",v[k-1]);
}
else
{
for (i=l+1; i<=n; i++)
{
v[p]=i;
wtf(p+1,i);
v[p]=0;
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
wtf(0,0);
fclose(stdin);
fclose(stdout);
return 0;
}
