lzy我就来随便逛逛的博客

1037 Magic Coupon （25 分）The magic shop in Mars is offering some magic coupons. Each coupon has an integer N printed on it, meaning that when you use this coupon with a product, you may get N times t...

1050 String Subtraction （20 分）Given two strings S​1​​ and S​2​​, S=S​1​​−S​2​​ is defined to be the remaining string after taking all the characters in S​2​​ from S​1​​. Your task is simply to calcu...

1042 Shuffling Machine （20 分）Shuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techniques are seen as weak, and in order to avoid "inside jobs" where emp...

A reversible prime in any number system is a prime whose "reverse" in that number system is also a prime. For example in the decimal system 73 is a reversible prime because its reverse 37 is also a pr...

这道题其实没多大意思，就是求最好排名并把最好排名以及这个排名对应的字母输出，这题就结束了。我的话主要思路是这样的，把每个人每一科的成绩排名都求出，而要求排名，那首先需要先按照成绩排序，直接调用sort函数就行了，排完序再求排名，这个地方有个要注意的点就是某一科同分的人的那个科目的排名是一样的。代码有点小啰嗦，但其实不复杂，就是排序+排名那块再加上最后输出结果的时候做逻辑判断那块有一些啰嗦的代码，照...

题目如下：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...

1024 Palindromic Number （25 分）A number that will be the same when it is written forwards or backwards is known as a Palindromic Number. For example, 1234321 is a palindromic number. All sin...

1027 Colors in Mars （20 分）People in Mars represent the colors in their computers in a similar way as the Earth people. That is, a color is represented by a 6-digit number, where the first 2 digits a...

1021 Deepest Root （25 分）A graph which is connecte d and acyclic can be considered a tree. The hight of the tree depends on the selected root. Now you are supposed to find the root that results in a ...

1013 Battle Over Cities （25 分）It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We...

1004 Counting Leaves （30 分）A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.Input Specification:Each input file contains on...

1046 Shortest Distance （20 分）The task is really simple: given N exits on a highway which forms a simple cycle, you are supposed to tell the shortest distance between any pair of exits.Input Specif...

终于想起我的csdn密码系列。。大概算一算也有接近两个月没更了，一部分因为懒，一部分因为大三期末还是挺重要的，复习+考试前后一个多月，现在写这篇blog的时候已经在家呆了接近两周了，交完三月份的pat甲级考试的报名费接近二百大洋(真的很贵啊，有木有！)原本只要200，现在居然涨价了，用了牛客网的优惠券居然还要200，嘛，这钱就当给自己刷题找个动力喽。 扯远了，言归正传...

1051 Pop Sequence （25 分）Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a given sequence of numbers is a ...

1040 Longest Symmetric String （25 分）Given a string, you are supposed to output the length of the longest symmetric sub-string. For example, given Is PAT&TAP symmetric?, the longest symmetric sub...

1044 Shopping in Mars （25 分）Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diamond has a value (in Mars dollars M$). When making the payment, the cha...

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 ...

1041 Be Unique （20 分）Being unique is so important to people on Mars that even their lottery is designed in a unique way. The rule of winning is simple: one bets on a number chosen from [1,10​4​​]. T...

1031 Hello World for U （20 分）Given any string of N (≥5) characters, you are asked to form the characters into the shape of U. For example, helloworld can be printed as:h de ll rlowoThat ...

1025 PAT Ranking （25 分）Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several pl...

这题其实就是一道水题，简而言之，就是字符串的替换，然后再加一点条件判断，比如n的大小和m的大小，其他没啥了#include<iostream>#include<vector>#include<string>using namespace std;int main(){ int n; cin >> n; vector<st...

先吐槽一下我自己，每次一放假，作息就会乱得一团糟，一玩游戏就啥都忘了，喂喂，pat报名费二百大洋呢！言归正传，先大概讲一下这题什么意思。其实这题就是一个多项式相乘问题，输入两个多项式然后输出相乘的结果，虽然总的来说这题挺简单，但是坑还是有那么几个。首先，输出要按照指数递减顺序，也就是按照数学中的习惯，那么这个地方就需要一个排序，其次要输出非零项个数再输出非零项，这一点我自己刚开始也没有注意到，...

先扔完整代码，可通过在线测试，具体迟点再写#include<iostream>#include<vector>using namespace std;int main(){ int m, n; cin >> m; vector<int> arr1(m); for (int i = 0; i < m; i++) { c...