Pagini recente » Cod sursa (job #3163267) | Cod sursa (job #1447164) | Cod sursa (job #2111318) | Cod sursa (job #1843625) | Cod sursa (job #181704)
Cod sursa(job #181704)
#include <stdio.h>
FILE *f,*g;
int n,m,i,a[100],k,j;
void afisare(void)
{
int i;
for(i=1;i<=m;i++)
fprintf(g,"%d ",a[i]);
fprintf(g,"\n");
}
int main()
{
f=fopen("combinari.in","r");
g=fopen("combinari.out","w");
fscanf(f,"%d\n",&n);
m=n;
for(i=1;i<=m;i++) a[i]=i; //cea mai mica submiltime de m elemente posibila
while(1)
{
afisare(); //afisez submultimea
for(k=m;a[k]==n-m+k;k--);
if(k==0) break;
else
{
a[k]++;
for(j=k+1;j<=m;j++)
a[j]=a[j-1]+1;
}
}
fclose(f); fclose(g);
return 0;
}