PAT甲级1002

#include <stdio.h>
#include <stdlib.h>
//注意、合并后系数为零的项要丢掉 
struct Polynomials{
    int exponents;
    float coefficients;
}; 
int main(int argc, char *argv[]) {
    int coefficients_num_1,coefficients_num_2,i,j,k;
    scanf("%d",&coefficients_num_1);
    struct Polynomials polynomials_1[coefficients_num_1];
    for(i=0;i<coefficients_num_1;i++){
        scanf(" %d %f",&polynomials_1[i].exponents,&polynomials_1[i].coefficients);
    }
    scanf("%d",&coefficients_num_2);
    struct Polynomials polynomials_2[coefficients_num_2];
    for(i=0;i<coefficients_num_2;i++){
        scanf(" %d %f",&polynomials_2[i].exponents,&polynomials_2[i].coefficients);
    }
    struct Polynomials polynomials_3[coefficients_num_1+coefficients_num_2];
    i=0;j=0;k=0;
    while(i<coefficients_num_1||j<coefficients_num_2){
        if(i<coefficients_num_1&&j<coefficients_num_2){
            if(polynomials_1[i].exponents>polynomials_2[j].exponents){
                polynomials_3[k].exponents=polynomials_1[i].exponents;
                polynomials_3[k].coefficients=polynomials_1[i].coefficients;
                i++;
                k++;
            }else if(polynomials_1[i].exponents<polynomials_2[j].exponents){
                polynomials_3[k].exponents=polynomials_2[j].exponents;
                polynomials_3[k].coefficients=polynomials_2[j].coefficients;
                j++;
                k++;
            }else if(polynomials_1[i].exponents==polynomials_2[j].exponents){
                polynomials_3[k].exponents=polynomials_1[i].exponents;
                polynomials_3[k].coefficients=polynomials_1[i].coefficients+polynomials_2[j].coefficients;
                if(polynomials_3[k].coefficients==0){
                    i++;
                    j++;
                    continue;
                }else{
                    i++;
                    j++;
                    k++;
                }

            }
        }else if(i<coefficients_num_1&&j>=coefficients_num_2){
            polynomials_3[k].exponents=polynomials_1[i].exponents;
            polynomials_3[k].coefficients=polynomials_1[i].coefficients;
            i++;
            k++;
        }else if(i>=coefficients_num_1&&j<coefficients_num_2){
            polynomials_3[k].exponents=polynomials_2[j].exponents;
            polynomials_3[k].coefficients=polynomials_2[j].coefficients;
            j++;
            k++;
        }
    }
    printf("%d",k);
    for(i=0;i<k;i++){
        printf(" %d %.1f",polynomials_3[i].exponents,polynomials_3[i].coefficients);
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值