Cod sursa(job #793783)
Utilizator | Data | 4 octombrie 2012 08:39:04 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <stdio.h>
void back(int s[100],int n,int k,int l)
{
int i;
if(l==k)
{
for(i=1;i<=k;i++)
printf("%d ",s[i]);
printf("\n");
}
else
for(i=s[l]+1;i<=n;i++)
{
s[l+1]=i;
back(s,n,k,l+1);
}
}
int main(void)
{
FILE *f,*g;
int i,n,k,s[100],l=0;
f=fopen("combinari.in","r");
g=fopen("combinari.out","w");
fscanf(f,"%d %d",&n,&k);
for(i=0;i<=n;i++)
s[i]=0;
back(s,n,k,l);
fclose(f); fclose(g);
return 0;
}