Cod sursa(job #440904)
Utilizator | Sandu Bogdan-Mihai Odin | Data | 12 aprilie 2010 17:32:21 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
int n,k,s[1000],i;
void backtracking(int l)
{
if(l==k+1)
{
for(i=1;i<=k;i++)
printf("%d ",s[i]);
printf("\n");
}
else
{
s[l]=s[l-1];
while(s[l]<n)
{
s[l]++;
backtracking(l+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
backtracking(1);
return 0;
}