PTA 7-1 一元多项式的乘法与加法运算

PTA 7-1 一元多项式的乘法与加法运算

设计函数分别求两个一元多项式的乘积与和。

#include #include #include #include using namespace std;const int maxn = 5000;int x[maxn], n1, n2, flag;struct Data { int x, y;}data1[maxn], data2[maxn];void output() { flag = 0; for (int i = 2000; i >= 0; i--) { if (x[i]) { if (flag++) printf(" "); printf("%d %d", x[i], i); } } if (flag == 0) printf("0 0"); printf("\n");}int main() { scanf("%d", &n1); for (int i = 1; i <= n1; i++) scanf("%d %d", &data1[i].x, &data1[i].y); scanf("%d", &n2); for (int i = 1; i <= n2; i++) scanf("%d %d", &data2[i].x, &data2[i].y); memset(x, 0, sizeof(x)); for (int i = 1; i <= n1; i++) { for (int j = 1; j <= n2; j++) { x[data1[i].y + data2[j].y] += data1[i].x * data2[j].x; } } output(); memset(x, 0, sizeof(x)); for (int i = 1; i <= n1; i++) x[data1[i].y] += data1[i].x; for (int i = 1; i <= n2; i++) x[data2[i].y] += data2[i].x; output(); return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。