Pagini recente » Cod sursa (job #669312) | Cod sursa (job #416221) | Cod sursa (job #1851481) | Cod sursa (job #797615) | Cod sursa (job #979696)
Cod sursa(job #979696)
#include<iostream>
#include<stdio.h>
using namespace std;
FILE *f,*g;
int n,k,sol[100];
int back(int l)
{int i;
if(l==k+1)
{for(i=1;i<=k;i++)
fprintf(g,"%d ",sol[i]);
fprintf(g,"\n");
}
else
{if(l>1)
sol[l]=sol[l-1];
else
sol[l]=0;
while(sol[l]<n-k+l)
{sol[k]++;
back(l+1);
}
}
}
int main()
{
f=fopen("combinari.in","r");
g=fopen("combinari.out","w");
fscanf(f,"%d%d",&n,&k);
back(1);
}