1009. Product of Polynomials (25)
#include "stdafx.h"
#include <iostream>
#include <map>using namespace std;int main()
{int n1;scanf("%d", &n1);int i, a;double b;map<int, double> m[2];for(i = 1; i <= n1; i++){scanf("%d%lf", &a, &b);m[0][a] = b;}int n2;scanf("%d", &n2);map<int, double> ::reverse_iterator it;int first;double second;for(i = 1; i <= n2; i++){scanf("%d%lf", &a, &b);for(it = m[0].rbegin(); it != m[0].rend(); it++){first = it->first + a;second = it->second * b;m[1][first] += second;}}int count = 0;for(it = m[1].rbegin(); it != m[1].rend(); it++){second = it->second;if(second != 0){count++;}}printf("%d", count);for(it = m[1].rbegin(); it != m[1].rend(); it++){first = it->first;second = it->second;if(second != 0){printf(" %d %.1lf", first, second);}}printf("\n");system("pause");return 0;
}
本文来自互联网用户投稿，该文观点仅代表作者本人，不代表本站立场。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如若转载，请注明出处：http://www.mzph.cn/news/974033.shtml
如若内容造成侵权/违法违规/事实不符，请联系多彩编程网进行投诉反馈email:809451989@qq.com，一经查实，立即删除！)
)
)
)
)
)
