This time, you are supposed to find A+B where A and B are two polynomials.
Input
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
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
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <string.h>
using namespace std;
double polyRes[1001];
int main()
{
int k, nk,max,cnt;
double ank;
//initial polyRes[]
memset(polyRes, 0, sizeof(int));
//input the first line
cin >> k;
max = 0;
while (k--)
{
cin >> nk >> ank;
polyRes[nk] += ank;
if (nk > max)
max = nk;
}
//input the second line
cin >> k;
while (k--)
{
cin >> nk >> ank;
polyRes[nk] += ank;
if (nk > max)
max = nk;
}
//count the number of similar terms & output
cnt = 0;
for (int i = max; i >= 0; i--)
{
if (polyRes[i] != 0)
cnt++;
}
cout << cnt ;
//ouput the similar terms
for (int j = max; j >= 0; j--)
{
if (polyRes[j] != 0)
cout << " "<<j << " "
<< setiosflags(ios::fixed) << setprecision(1) << polyRes[j];
//printf(" %d %.1lf",j,polyRes[j]);
}
cin.get();
cin.get();
return 0;
}
get:
1.polyRes[1001]必须设为全局变量
2.注意while部分的循环读入方式
3.本题最大的问题还是在于cout的格式化输出
setiosflags(ios::fixed) 和 setprecision(1) 保证了只输出浮点数小数>点后一位,注意包含头文件string.h
等效于C中的 格式化输出printf(” %d %.1lf”,j,polyRes[j]);
- memset函数注意要包含头文件iomainip
void memset ( void * ptr, int value, size_t num );*
Sets the first num bytes of the block of memory pointed by ptr to the specified value (interpreted as an unsigned char).