Y63__-CSDN博客

翻译寒假翻译题训练 2月19号

链接：https://acs.jxnu.edu.cn/problem/HDU1026题目：描述：The Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng5166's castle. The castle is a large labyrinth. To make the problem s

2022-02-19 22:03:55 99

翻译寒假翻译题训练 2月18号

链接：https://acs.jxnu.edu.cn/problem/HDU1025题目：描述：the JGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines.Half of these cities are rich in resource (we call them rich cities) while the ot

2022-02-18 23:26:28 180

翻译寒假翻译题训练 2月17号

链接：https://acs.jxnu.edu.cn/problem/HDU1024题目：描述：Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem.Given a

2022-02-17 22:57:35 129

翻译寒假翻译题训练 2月16号

链接：https://acs.jxnu.edu.cn/problem/HDU1023题目：描述：As we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders that all the trains can get out of the railway

2022-02-16 22:23:41 107

翻译寒假翻译题训练 2月14号

链接：https://acs.jxnu.edu.cn/problem/HDU1022题目：描述：As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is the fastest all over th

2022-02-14 23:14:58 83

翻译寒假翻译题训练 2月13号

链接：https://acs.jxnu.edu.cn/problem/HDU1021题目：描述：There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).输入：Input consists of a sequence of lines, each containing an integer n. (n < 1,000,000).输出：

2022-02-13 22:46:15 77

翻译寒假翻译题训练 2月12号

链接：https://acs.jxnu.edu.cn/problem/HDU1020题目：描述：Given a string containing only 'A' - 'Z', we could encode it using the following method:1. Each sub-string containing k same characters should be encoded to "kX" where "X" is the only character in thi

2022-02-12 20:50:46 64

翻译寒假翻译题训练 2月11号

链接：https://acs.jxnu.edu.cn/problem/HDU1019题目：描述：The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15 is 105.输入：Inpu.

2022-02-11 22:07:13 111

翻译寒假翻译题训练 2月10号

链接：https://acs.jxnu.edu.cn/problem/HDU1018题目：描述：In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a number, you ha

2022-02-10 23:21:18 139

翻译寒假翻译题训练 2月9号

链接：https://acs.jxnu.edu.cn/problem/HDU1016题目：描述：Given two integers n and m, count the number of pairs of integers (a,b) such that 0 < a < b < n and (a^2+b^2 +m)/(ab) is an integer.This problem contains multiple test cases!The first line o

2022-02-09 23:10:21 66

翻译寒假翻译题训练 2月8号

链接：题目：描述：A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.Note: the number of first circle should always be 1.输入：n

2022-02-08 22:41:47 51

翻译寒假翻译题训练 2月7号

链接：https://acs.jxnu.edu.cn/problem/HDU1015题目：描述：=== Op tech briefing, 2002/11/02 06:42 CST ==="The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, along with Klein an

2022-02-07 23:20:42 149

翻译寒假翻译题训练 2月6号

链接https://acs.jxnu.edu.cn/problem/HDU1014题目：描述：Computer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formseed(x+1) = [seed(x) + STEP] % MODwhere '%' is the modulus operator.Suc

2022-02-06 22:10:05 94

翻译寒假翻译题训练 2月5号

链接：https://acs.jxnu.edu.cn/problem/HDU1013题目：描述：The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains two o

2022-02-05 21:54:27 104

翻译寒假翻译题训练 1月29号

链接：https://acs.jxnu.edu.cn/problem/HDU1012题目：描述：A simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.输出：Output the approximation

2022-01-29 23:32:25 317

翻译寒假翻译题训练 1月28号

链接：https://acs.jxnu.edu.cn/problem/HDU1011题目：描述：You, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a huge cavern, which consists of many rooms connected with tunnels. Each room

2022-01-29 00:10:43 72

翻译寒假翻译题训练 1月27号

链接：https://acs.jxnu.edu.cn/problem/HDU1010题目：描述：The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone w

2022-01-27 23:26:50 66

翻译寒假翻译题训练 1月26号

链接：https://acs.jxnu.edu.cn/problem/HDU1009题目：描述：FatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room contains J[i] pounds o

2022-01-27 00:02:26 75

翻译寒假翻译题训练1月25号

链接：https://acs.jxnu.edu.cn/problem/HDU1008题目：描述：The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seco

2022-01-25 22:19:07 54

翻译寒假翻译题训练 1月24号

链接：https://acs.jxnu.edu.cn/problem/HDU1007题目：描述：Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In the field of Cyberground, the position of each toy is f

2022-01-24 22:44:19 45

翻译寒假翻译训练题 1月23号

链接：https://acs.jxnu.edu.cn/problem/HDU1006题目：描述：The three hands of the clock are rotating every second and meeting each other many times everyday. Finally, they get bored of this and each of them would like to stay away from the other two. A hand is

2022-01-23 22:50:13 56

翻译寒假翻译题训练 1月22日

链接：https://acs.jxnu.edu.cn/problem/HDU1005题目：描述：A number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n).输入：The input consists of multipl

2022-01-22 23:13:11 72

翻译寒假翻译题训练 1月21号

链接：Let the Balloon Rise | JXNUOJ题目：描述：Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the ball

2022-01-21 22:04:08 75

翻译寒假翻译题1月20日

链接：Max Sum | JXNUOJ题目：描述：Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.输入：The first line of the input co

2022-01-20 22:40:41 53

翻译寒假翻译题训练 1月19日

链接：A + B Problem II | JXNUOJ题目：描述：I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.输入：The first line of the input contains an integer T(1<=T<=20) which means the number of test cas

2022-01-19 22:32:53 95

翻译寒假翻译题训练 1月18号

链接：Sum Problem | JXNUOJ题目：描述：Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n.输入：The input will consist of a series of integers n, one integer per line.输出：

2022-01-18 21:22:48 94

翻译寒假翻译题训练 1月17号

链接：A + B Problem | JXNUOJ题目：描述：Calculate A + B.输入：Each line will contain two integers A and B. Process to end of file.输出：For each case, output A + B in one line.翻译如下描述：计算A+B。输入：每一行包含两个整型 A和B，程序运行到输入的文件末尾截止。输出：每一行输出A和B的和。...

2022-01-17 19:02:44 73

Y63__的博客