Cod sursa(job #342942)
Utilizator | Data | 24 august 2009 14:29:37 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <stdio.h>
int s[20], n, k;
void back(int l)
{
if (l==k)
{
for(int i=1; i<=k; ++i)
printf("%d",s[i]);
printf("\n");
}
else
{
for (int i=1+s[l]; i<=n; ++i)
{
s[l+1]=i;
back(l+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
back(0);
return 0;
}