PAT (Advanced Level) 1002 A+B for Polynomials

最新推荐文章于 2024-09-04 16:56:47 发布

Yi_Qing_Z

最新推荐文章于 2024-09-04 16:56:47 发布

阅读量127

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/Yi_Qing_Z/article/details/83716442

版权

PAT 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

1002 A+B for Polynomials （25 分）

This time, you are supposed to find A+B where A and B are two polynomials.

Input Specification:

Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial:

K N1 aN1 N2 aN2 ... NK aNK

where K is the number of nonzero terms in the polynomial, Ni and aNi (i=1,2,⋯,K) are the exponents and coefficients, respectively. It is given that 1≤K≤10，0≤NK<⋯<N2<N1≤1000.

Output Specification:

For each test case you should output the sum of A and B in one line, with the same format as the input. Notice that there must be NO extra space at the end of each line. Please be accurate to 1 decimal place.

Sample Input:

2 1 2.4 0 3.2
2 2 1.5 1 0.5

Sample Output:

3 2 1.5 1 2.9 0 3.2

水题……还WA了几次
计算两个多项式A+B相加的结果
段错误：1)访问系统数据区，尤其是往系统保护的内存地址写数据最常见就是给一个指针以0地址。2)内存越界(数组越界，变量类型不一致等)：访问到不属于你的内存区域。——感觉和runtime error差不多
读题要仔细啊！！！

#include<stdio.h>
#include<string.h>
#define maxn 1005
double ans[maxn];

int main()
{
    int k;
    while(scanf("%d",&k)!=EOF)
    {
        memset(ans,0,sizeof(ans));
        int n,number=0;
        double an;
        for(int i=1;i<=k;i++)
        {
            scanf("%d",&n);
            scanf("%lf",&an);
            ans[n]+=an;
        }
        scanf("%d",&k);
        for(int i=1;i<=k;i++)
        {
            scanf("%d",&n);
            scanf("%lf",&an);
            ans[n]+=an;
        }
        for(int i=0;i<=1000;i++)
            if(ans[i]!=0)
                number++;
        printf("%d",number);
        for(int i=1000;i>=0;i--)
            if(ans[i])
                printf(" %d %.1lf",i,ans[i]);
        printf("\n");
    }
    return 0;
}