PAT a1002题解
来源:互联网 发布:如何评价地狱边境 知乎 编辑:程序博客网 时间:2024/05/17 22:32
#include <cstdio>const int MAXN = 1005;double p[MAXN] = {};int main(){ int k, n, count = 0;double a;scanf("%d", &k);for(int i = 0; i < k; i++){scanf("%d%lf", &n, &a);p[n] += a;}scanf("%d", &k);for(int i = 0; i < k; i++){scanf("%d%lf", &n, &a);p[n] += a;}for(int i = 0; i < MAXN; i++){if(p[i] != 0){count++;}}printf("%d", count);for(int i = MAXN - 1; i >= 0; i-- ){if(p[i] != 0)printf(" %d %.1f", i, p[i]);}return 0;}
阅读全文
1 0
- PAT a1002题解
- [PAT] A1002
- PAT A1002
- pat a1002
- PAT-A1002
- 浙大 PAT a1002
- PAT A1002 A+B for Polynomials
- PAT A1002. A+B for Polynomials
- PAT A1002 A+B for Polynomials (25)
- 【PAT】A1002. A+B for Polynomials (25)
- PAT---A1002. A+B for Polynomials (25)
- PAT A1002. A+B for Polynomials (25)
- PAT A1002 A+B for Polynomials(25)
- PAT A1002. A+B for Polynomials
- PAT甲级练习题A1002. A+B for Polynomials
- PAT 1001-1010 题解
- PAT 1011-1020 题解
- PAT 1021-1030 题解
- PAT a1001题解
- 网络配置,内网无法访问外网
- Kotlin简介和成功创建的简单介绍
- WPF Focus 无法获取焦点问题
- BZOJ 1642 [Usaco2007 Nov]Milking Time 挤奶时间 排序+DP
- PAT a1002题解
- Dreamweaver 8安装
- TensorFlow学习笔记(二)MNIST入门
- 关于KEIL5打开KEIL4工程之后工程后缀变为uvprojx
- Git(分布式版本控制系统)——操作篇(二)
- SQL 快速参考
- PAT a1004题解
- js domcontentloader
- sklearn学习之贝叶斯分类