【c++】PAT (Advanced Level)1009. Product of Polynomials (25)
来源:互联网 发布:一加3邀请码淘宝多少钱 编辑:程序博客网 时间:2024/04/29 16:19
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 product 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 up to 1 decimal place.
Sample Input2 1 2.4 0 3.22 2 1.5 1 0.5Sample Output
3 3 3.6 2 6.0 1 1.6
1.写公式的时候太理所当然了,b[i+m]=n*a[i]+b[i+m]; 忘记加上原来的数字了
2.数组溢出, 1000次方和1000次方是两千次方,所以b[i]溢出。
#include <iostream>#include <iomanip>using namespace std;int main() {int k;cin>>k;double a[1001]={0.0},b[2001]={0.0};while(k--){int m;double n;cin>>m>>n;a[m]=n;}cin>>k;int i;while(k--){int m;double n;cin>>m>>n;for( i=0;i<=1000;i++){if(a[i]!=0){b[i+m]=n*a[i]+b[i+m]; }}}k=0;for( i=0;i<=2000;i++){if(b[i]!=0){k++;}}cout<<k;for(i=2000;i>=0;i--){if(b[i]!=0){cout<<" "<<i<<" "<<fixed<<setprecision(1)<<b[i];}}system("pause");return 0;}
- 【c++】PAT (Advanced Level)1009. Product of Polynomials (25)
- PAT(Advanced level) 1009. Product of Polynomials
- 【PAT Advanced Level】1009. Product of Polynomials (25)
- PAT (Advanced Level) Practise 1009. Product of Polynomials (25)
- PAT (Advanced Level) 1009. Product of Polynomials (25) 多项式相乘
- 【PAT】【Advanced Level】1009. Product of Polynomials (25)
- PAT (Advanced Level) Practise 1009. Product of Polynomials (25)
- PAT (Advanced) 1009. Product of Polynomials (25)
- [PAT (Advanced Level) ]1009. Product of Polynomials 解题文档
- 浙大 PAT Advanced level 1009. Product of Polynomials
- 浙大PAT (Advanced Level) Practise 1009 Product of Polynomials (25)
- PAT (Advanced Level) Practise 1009Product of Polynomials (25)
- 1009. Product of Polynomials (25)——PAT (Advanced Level) Practise
- Pat(Advanced Level)Practice--1009(Product of Polynomials)
- PAT(Advanced Level) 1009 - Product of Polynomials(水题)
- PAT (Advanced Level) Practise 1009 Product of Polynomials
- 【PAT甲级】【C++】1009. Product of Polynomials (25)
- 1009. Product of Polynomials (25)-PAT
- Bossie2013年度评选:最佳开源应用
- uboot在2440上的移植
- Java 文件上传组件 Apache Commons FileUpload 应用指南(二)——FileUpload如何工作?
- C++11中的string - atoi/itoa
- Unity3D C# 单例模式
- 【c++】PAT (Advanced Level)1009. Product of Polynomials (25)
- WebStorm 7.0 注册码
- 杂记
- Deep Learning(深度学习)学习笔记整理系列之(六)
- 关于网站SEO优化的20个热点问答
- iphone开发常引用的类模块说明
- Linux下如何测试及使用USB转串口线
- 【struts2】
- Qt Windows下链接子系统与入口函数(终结版)