1016 Phone Bills (25 分)   A long-distance telephone company charges its customers by the following rules: Making a long-distance call costs a certain amount per minute, depending on the time of day when the call is made. When a customer starts connec…

题目链接 https://www.patest.cn/contests/pat-a-practise/1028 思路 就按照 它的三种方式 设计 comp 函数 然后快排就好了 但是 如果用 c++ 中的 string 保存名字的话 就会超时 所以 用 c 里面的 char *s 就可以过 AC代码 #include <cstdio> #include <cstring> #include <ctype.h> #include <cstdlib> #incl…

PAT甲级1016. Phone Bills 题意: 长途电话公司按以下规定向客户收取费用: 长途电话费用每分钟一定数量,具体取决于通话时间.当客户开始连接长途电话时,将记录时间,并且客户挂断电话时也是如此. 每个日历月份,每分钟都会向客户发送一个帐单(按照一天中的时间确定).您的工作是为每个月准备账单,给出一组电话记录. 输入: 每个输入文件包含一个测试用例.每个案例有两部分:费率结构和电话记录. 费率结构包括一个24个非负整数表示从00:00至01:00的收费(分/分),01:00至02:0…

题目链接 https://www.patest.cn/contests/pat-b-practise/1085 思路 结构体排序 要注意几个点 它的加权总分 是 取其整数部分 也就是 要 向下取整 然后这个操作要在排序操作之前 不能在输出的时候 进行 不然最后一个测试点 过不了 因为 假如 有两个学校的分数 分别是 195.1 195.2 如果排序按照这个排 就是 195.1 < 195.2 就会按照 总分来排 但实际上 向下取整之后 都是195 所以应该按照 考生人数 或者是单位码来排的 还有…

题目:https://www.patest.cn/contests/pat-a-practise/1016 思路:用结构体存储,按照名字和日期排序,然后先判断是否有效,然后输出,时间加减直接暴力即可 #include<set> #include<map> #include<queue> #include<algorithm> #include<iostream> #include<cstdio> #include<vector&…

1020 Tree Traversals (25分)   Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the corresponding binary tre…

1146 Topological Order (25 分)   This is a problem given in the Graduate Entrance Exam in 2018: Which of the following is NOT a topological order obtained from the given directed graph? Now you are supposed to write a program to test each of the optio…

1071 Speech Patterns (25 分)   People often have a preference among synonyms of the same word. For example, some may prefer "the police", while others may prefer "the cops". Analyzing such patterns can help to narrow down a speaker's id…

1063 Set Similarity (25 分)   Given two sets of integers, the similarity of the sets is defined to be /, where N​c​​ is the number of distinct common numbers shared by the two sets, and N​t​​ is the total number of distinct numbers in the two sets. Yo…

1059 Prime Factors (25 分)   Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p​1​​​k​1​​​​×p​2​​​k​2​​​​×⋯×p​m​​​k​m​​​​. Input Specification: Each input file contains one test case whi…