Pagini recente » Cod sursa (job #1488425) | Cod sursa (job #2780617) | Cod sursa (job #2063587) | Cod sursa (job #3136614) | Cod sursa (job #171191)
Cod sursa(job #171191)
#include<stdio.h>
FILE *f1,*f2;
long a,b,c,n,j,k;
int v[22];
void rec(long i,long z){
if(i!=0){
if(z>0){
b=v[i];
v[i]=v[i-1];
if(b>v[i]){
v[i]=b;
}
}
v[i]++;
if(v[i]>n||i>k){
v[i]=0;
rec(i-1,-1);
}
else{
if(i==k){
if(a){
fprintf(f2,"\n");
}
for(j=1;j<=k;fprintf(f2,"%d ",v[j]),j++);
a=1;
}
if(i<=k){
rec(i+1,1);
}
}
// v[i]=v[i]+1;
// if(v[i]>n||i>k){
// v[i]=0;
// rec(i-1,-1);
}
// }
}
int main(){
f1=fopen("combinari.in","r");
f2=fopen("combinari.out","w");
fscanf(f1,"%ld%ld",&n,&k);
v[0]=0;
rec(1,1);
return 0;
}