![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
PAT甲级
iamacaicaicai
这个作者很懒,什么都没留下…
展开
-
1002 A+B for Polynomials简单
这个可以直接用一个c[10001]的数组存系数,里面的标号是指数,值为系数,分别加上a,b的就可以了。`#include<iostream>#include<cstdio>using namespace std;struct node{ int exp; double coef;}a[10],b[10];double c[10001]={0.0};int ...原创 2019-11-18 11:52:00 · 78 阅读 · 0 评论 -
考试经验总结
https://blog.csdn.net/a845717607/article/details/88084747原创 2019-11-18 10:43:48 · 155 阅读 · 0 评论 -
1087 All Roads Lead to Rome经典dijkstra算法(较难)
Indeed there are many different tourist routes from our city to Rome. You are supposed to find your clients the route with the least cost while gaining the most happiness.Input Specification:Each in...原创 2019-11-18 09:26:23 · 113 阅读 · 0 评论 -
1089. Insert or Merge插入排序和归并排序
1089 Insert or Merge (25 分)According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one e...原创 2019-11-08 09:45:07 · 111 阅读 · 0 评论 -
1090 Highest Price in Supply Chain
A supply chain is a network of retailers(零售商), distributors(经销商), and suppliers(供应商)-- everyone involved in moving a product from supplier to customer.Starting from one root supplier, everyone on the...原创 2019-11-18 07:59:39 · 62 阅读 · 0 评论 -
1092 To Buy or Not to Buy
Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many colorful strings of beads. However the owner of the shop would only sel...原创 2019-11-18 07:59:54 · 63 阅读 · 0 评论