A1002 A+B for Polynomials (25)

来源:互联网 发布:mysql唯一性约束 编辑:程序博客网 时间:2024/05/16 03:32
1002. A+B for Polynomials (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueThis time, you are supposed to find A+B where A and B are two polynomials.InputEach 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.OutputFor 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 Input2 1 2.4 0 3.22 2 1.5 1 0.5Sample Output3 2 1.5 1 2.9 0 3.2
</pre><pre name="code" class="cpp">#include<cstdio>int main(){int a,k,count = 0;double b,s[1001] = {0};scanf("%d",&k);for(int i = 0;i < k;i++){scanf("%d %lf",&a,&b);s[a] += b;}scanf("%d",&k);for(int i = 0;i < k;i++){scanf("%d %lf",&a,&b);s[a] += b;}for(int i = 0;i < 1001;i++){if(s[i]!=0) count++;}if(count){printf("%d ",count);for(int i = 1000;i >=0;i--){if(s[i]!=0) {printf("%d %.1f",i,s[i]);count--;if(count) printf(" ");}}}else printf("0");           //注意最后没有非零项时只输出0return 0;}

0 0