pat 1002 A+B for Polynomials
来源:互联网 发布:计算机存储数据原理 编辑:程序博客网 时间:2024/05/07 19:49
简单的多项式相加。用两个数组分别保存,找出最大的下标,逐项相加。
#include<iostream>using namespace std;const int num=1005;double a[num],b[num];int main(){int n,i,index,m;double val;int alen=-1,blen=-1,count=0;scanf("%d",&n);while(n--){scanf("%d%lf",&index,&val);a[index]=val;if(alen==-1)alen=index;}scanf("%d",&m);while(m--){scanf("%d%lf",&index,&val);b[index]=val;if(blen==-1)blen=index;}if(alen<blen)alen=blen;for(i=alen;i>=0;i--){a[i]+=b[i];if(a[i]!=0.0)count++;}printf("%d",count);for(i=alen;i>=0;i--){if(a[i]!=0.0)printf(" %d %.1lf",i,a[i]);}return 0;}
- pat 1002 A+B for Polynomials
- PAT 1002 A+B for Polynomials
- pat 1002 A+B for Polynomials
- PAT 1002 A+B for Polynomials
- PAT 1002 A+B for Polynomials
- PAT-甲级-1002 A+B for Polynomials
- PAT 1002 A+B for Polynomials (25)
- PAT A 1002. A+B for Polynomials
- PAT-A 1002.A+B for Polynomials
- PAT-A-1002. A+B for Polynomials
- 浙大PAT 1002题 1002. A+B for Polynomials
- Pat(Advanced Level)Practice--1002(A+B For Polynomials)
- PAT Advanced Level 1002:A+B for Polynomials
- PAT (Advanced Level) Practise 1002 A+B for Polynomials (25)
- PAT 1002 . A+B for Polynomials (25)多项式加法
- PAT (Advanced Level) Practise 1002A+B for Polynomials (25)
- PAT (Advanced Level) Practise 1002 A+B for Polynomials
- PAT 1002 A+B for Polynomials(简单计数)
- iphone的shsh备份实用方法
- svn 本地文件夹locked ,无法提交和cleanup
- 钢筋套筒的简介
- [C语言]字符串处理 - ANSI - Unicode - UTF8 转换
- Nginx模块-lua-nginx-module
- pat 1002 A+B for Polynomials
- sqlsever数据库为只读的修改办法
- Android网络编程一
- Key-Value-Observing(KVO,键值观察)
- 封装一个HTTP请求的辅助类
- 【转】css定义table
- CVE-2013-0636
- 移动互联网5大趋势
- Tsung-report