- 博客(13)
- 收藏
- 关注
RSS订阅原创 PAT甲级真题-C++-Highest Price in Supply Chain
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 c
2022-01-23 19:19:54
291
原创 PAT甲级真题-C++-The Largest Generation
The Largest Generation-->练习此题<--题目描述:A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level belong to the same generation. Your task is to find the generation with the largest population.输入描述:Each in
2022-01-23 17:11:49
371
原创 PAT甲级真题-C++-Stack
Stack-->练习此题<--题目描述:Stack is one of the most fundamental data structures, which is based on the principle of Last In First Out (LIFO). The basic operations include Push (inserting an element onto the top position) and Pop (deleting the top eleme
2022-01-23 00:19:40
104
原创 PAT甲级真题-C++-Hello World for U
Hello World for U-->练习此题<--题目描述:Given any string of N (>=5) characters, you are asked to form thecharacters into the shape of U. For example, “helloworld” canbe printed as:h de ll rlowoThat is, the char
2022-01-21 17:36:03
439
原创 PAT甲级真题-C++-Path of Equal Weight
Path of Equal Weight-->练习此题<--题目描述:Given a non-empty tree with root R, and with weight Wiassigned to each tree node Ti. The weight of a path from R to Lis defined to be the sum of the weights of all the nodes along the pathfrom R to any leaf
2022-01-21 16:43:11
324
原创 蓝桥杯第十二届省赛真题-砝码称重(C++)
砝码称重-->练习此题<--题目描述:你有一架天平和 N 个砝码，这 N 个砝码重量依次是 W1, W2, · · · , WN。请你计算一共可以称出多少种不同的重量？注意砝码可以放在天平两边。输入描述:输入的第一行包含一个整数 N。第二行包含 N 个整数：W1, W2, W3, · · · , WN。输出描述:输出一个整数代表答案。输入样例:31 4 6输出样例:10提示:【样例说明】能称出的 10 种重量是：1、2、3、4、5、6、7
2022-01-21 11:48:43
1156
原创 PAT甲级真题-C++-A+B and C (64bit)
A+B and C (64bit)-->练习此题<--题目描述:Given three integers A, B and C in [-263, 263), you are supposed to tell whether A+B > C.输入描述:The first line of the input gives the positive number of test cases, T (<=1000). Then T test cases follow, ea
2022-01-20 13:54:21
262
原创 PAT甲级真题-C++-A+B in Hogwarts
A+B in Hogwarts-->练习此题<--题目描述:If you are a fan of Harry Potter, you would know the world of magic has its own currency system – as Hagrid explained it to Harry, “Seventeen silver Sickles to a Galleon and twenty-nine Knuts to a Sickle, it’s easy e
2022-01-20 13:28:04
328
原创 PAT甲级真题-C++-Count PAT‘s
Count PAT's-->练习此题<--题目描述:The string APPAPT contains two PAT’s as substrings. The first one is formed by the 2nd, the 4th, and the 6th characters, and the second one is formed by the 3rd, the 4th, and the 6th characters.Now given any string, you
2022-01-19 19:52:51
577
原创 PAT甲级真题-C++-To Buy or Not to Buy
To Buy or Not to Buy-->练习此题<--题目描述:Eva would like to make a string of beads with her favorite colors so shewent to a small shop to buy some beads. There were many colorful strings of beads. However the owner of the shop would only sell the strin
2022-01-19 19:23:14
210
原创 蓝桥杯第四届真题-买不到的数目
买不到的数目-->练习此题<--题目描述:小明开了一家糖果店。他别出心裁：把水果糖包成4颗一包和7颗一包的两种。糖果不能拆包卖。小朋友来买糖的时候，他就用这两种包装来组合。当然有些糖果数目是无法组合出来的，比如要买 10 颗糖。你可以用计算机测试一下，在这种包装情况下，最大不能买到的数量是17。大于17的任何数字都可以用4和7组合出来。本题的要求就是在已知两个包装的数量时，求最大不能组合出的数字。输入描述:两个正整数，表示每种包装中糖的颗数(都不多于1000)输出描
2022-01-19 18:38:08
68
原创 PAT甲级真题-C++-Consecutive Factors (20)
Consecutive Factors (20)–>练习此题<–题目描述：Among all the factors of a positive integer N, there may exist several consecutive numbers. For example, 630 can be factored as 3 * 5 * 6 * 7, where 5, 6, and 7 are the three consecutive numbers. Now given a
2022-01-19 18:04:24
470
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人