多项式的加法之顺序表表示.doc

#include<>#include<>#definemax_list_size100typedefstruct{ int*dataxi;int*datami;intlength;}list_student;list_studentL1;list_studentL2;list_studentL3;intnum1;intnum2;voidcreat1(){ inti=0; intm; inthuanmi,huanxi;=(int*)malloc(max_list_size*sizeof(int)); =(int*)malloc(max_list_size*sizeof(int)); if((!)&&(!)) {printf("未建立成!"); system("PAUSE");exit(1);}=0; printf("请输入项数:\n");scanf("%d",&num1);if(num1>max_list_size-1||num1<0){printf("分配失败!\n"); system("PAUSE");exit(1);} printf("请输入第%d项的系数:\n",i);scanf("%d",&[i]); printf("请输入第%d项的幂数:\n",i); scanf("%d",&[i]); i++; ++;for(;i<num1;i++){printf("请输入第%d项的系数:\n",i);scanf("%d",&[i]); printf("请输入第%d项的幂数:\n",i); scanf("%d",&[i]);++; for(m=0;m<;m++) { if([i]!=[i-1]) { if([i]<[i-1]) { huanmi=[i]+[i-1]; [i]=huanmi-[i]; [i-1]=huanmi-[i-1]; huanxi=[i-1]+[i]; [i]=huanxi-[i]; [i-1]=huanxi-[i-1]; } } else { printf("该项已于之前项合并请重新输入!\n"); [i-1]=[i-1]+[i]; i--; --; } } }}voidcreat2(){ inti=0; intm; inthuanmi,huanxi;=(int*)malloc(max_list_size*sizeof(int)); =(int*)malloc(max_list_size*sizeof(int)); if((!)&&