Pagini recente » Cod sursa (job #2436276) | Cod sursa (job #1126408) | Cod sursa (job #1235905) | Cod sursa (job #707081) | Cod sursa (job #671408)
Cod sursa(job #671408)
#include <stdio.h>
int main(void)
{
FILE *f,*g;
int v[20],n,m,p=1,i;
f=fopen("combinar.in","r");
g=fopen("combinar.out","w");
fscanf(f,"%d",&m);
fscanf(f,"%d",&n);
printf("\nm=%d si n=%d\n",m,n);
for(i=0;i<n+2;i++) v[i]=0;
while(p)
{
v[p]++;
if( v[p]>m ) --p;
else if( p<n )
{
v[p+1]=v[p];
p++;
}
else
{
for(i=1;i<=n;i++) fprintf(g,"%d ",v[i]);
fprintf(g,"\n");
}
}
fclose(f);
fclose(g);
return 0;
}