Pagini recente » Cod sursa (job #1217282) | Cod sursa (job #644796) | Cod sursa (job #874118) | Cod sursa (job #2392909) | Cod sursa (job #283781)
Cod sursa(job #283781)
#include<stdio.h>
int k,cont,stiva[10],n,m,c[10],i;
int main (){
FILE *f = fopen("combinari.in","r");
FILE *g = fopen("combinari.out","w");
fscanf(f,"%d %d",&n,&m);
k=1;
stiva[k]=0;
while (k>0){
if (stiva[k]<n){
cont=1;
stiva[k]++;
if (c[stiva[k]]==1)
cont = 0;
else
c[stiva[k]]=1;
if (cont==1)
if (k==m){
for (i=1;i<=m;i++)
fprintf(g,"%d ",stiva[i]);
fprintf(g,"\n");
c[stiva[k]]=0;
}
else{
k++;
stiva[k]=stiva[k-1];
}
}
else{
c[stiva[k]]=c[stiva[k-1]]=0;
k--;
}
}
fclose(f);
fclose(g);
return 0;
}