Cod sursa(job #162642)
Utilizator | Data | 20 martie 2008 13:38:38 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
int a[20],n,k;
void back(int x)
{
if (x>k)
{
for (int i=1; i<=k; ++i) printf("%d ",a[i]);
printf("\n");
return;
}
for (int i=a[x-1]+1; i<=n; ++i)
{
a[x]=i;
back(x+1);
a[x]=0;
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
back(1);
return 0;
}