qq_33604355的博客

1001 A+B FormatCalculate a+b and output the sum in standard format – that is, the digits must be separated into groups of three by commas (unless there are less than four digits).Input Specification...

1002 A+B for Polynomials （25 分）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 ...

Dijkstra算法是典型的最短路径路由算法，用来计算一个节点到其他所有节点的最短路径。思路如下：1.初始化距离d[]2.找到未访问的最近的值，记录下来temp；3.以temp为基准更新d[]C++实现如下void DJ(int x){ fill(d, d + maxn, INF); d[x] = 0; for (int i = 0; i < n; i++){ int ...

1034 Head of a Gang （30 分）One way that the police finds the head of a gang is to check people’s phone calls. If there is a phone call between A and B, we say that A and B is related. The weight of a ...

模型：去银行等场所排队入场/N个窗口（球台），每个窗口后m人排队/按照时间顺序排队/其他人在等待区域/按时（8:00）开门（17:00）关门表述不太清楚、是十分贴近现实的银行办事排队的模型A1014是个基本的model，要求输出的是何时能够办事结束//模型认为所有的顾客都是在8:00进入排队序列首先建立一个队列模型：struct node{int poptime,Endtime;q...