- 博客(23)
- 收藏
- 关注
RSS订阅翻译 2.14题目翻译
https://acs.jxnu.edu.cn/problem/HDU1339Given a positive integer n and the odd integer o and the nonnegative integer p such that n = o2^p.ExampleFor n = 24, o = 3 and p = 3.TaskWrite a program which for each data set:reads a positive integer n,compu
2022-02-14 21:39:26
211
1
翻译 2.13题目翻译
https://acs.jxnu.edu.cn/problem/HDU1331We all love recursion! Don't we?Consider a three-parameter recursive function w(a, b, c):if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns:1if a > 20 or b > 20 or c > 20, then w(a, b, c) re
2022-02-13 20:22:37
255
翻译 2.12题目翻译
https://acs.jxnu.edu.cn/problem/HDU1323描述：From the article Number Theory in the 1994 Microsoft Encarta: "If a, b, c are integers such that a = bc, a is called a multiple of b or of c, and b or c is called a divisor or factor of a. If c is not 1/-1, b i
2022-02-12 22:01:04
287
翻译 2.11题目翻译
https://acs.jxnu.edu.cn/problem/HDU1317It has recently been discovered how to run open-source software on the Y-Crate gaming device. A number of enterprising designers have developed Advent-style games for deployment on the Y-Crate. Your job is to test a
2022-02-11 21:45:25
276
翻译 2.10题目翻译
https://acs.jxnu.edu.cn/problem/HDU1312There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can't move on red t
2022-02-10 20:58:29
205
翻译 2.9题目翻译
https://acs.jxnu.edu.cn/problem/HDU1307描述：An n-tersecntio is defined as a location in n-dimensional space, n being a positive integer, having all non-negative integer coordinates. For example, the location (1,2,3) represents an n-tersection in three di
2022-02-09 21:29:58
149
翻译 2.8题目翻译
题目链接：https://acs.jxnu.edu.cn/problem/HDU1303As part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integers and asked to determine how many items in each list are twice some other
2022-02-08 20:56:57
199
翻译 2.7题目翻译
题目链接：https://acs.jxnu.edu.cn/problem/HDU1295There are two color (white and black) chessmen in a row. The number of white chessman is equal to the number of black chessman. The left half of the row is black chessmen and the right half of the row is white
2022-02-07 20:50:37
117
翻译 2.6题目翻译
题目链接：https://acs.jxnu.edu.cn/problem/HDU1294Give you twodefinitionstree and rooted tree. An undirected connected graph without cycles is called a tree. A tree is called rooted if it has a distinguished vertex r called the root. Your task is to make a p..
2022-02-06 22:06:21
144
翻译 2.5题目翻译
题目链接https://acs.jxnu.edu.cn/problem/HDU1265Do you know IEEE's constact of single floating point data? If you are not sure, following is the contract:This problem is really simple for you: please convert the real data into the IEEE single floating poi
2022-02-05 19:43:06
498
翻译 1.29题目翻译
链接：https://acs.jxnu.edu.cn/problem/HDU1250Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [4,3,2,2,1,1], then there are four different sums
2022-01-29 13:13:30
180
翻译 1.28题目翻译
题目链接：https://acs.jxnu.edu.cn/problem/HDU1250描述：A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-3) + F
2022-01-28 16:25:04
199
翻译 1.27题目翻译
题目链接：https://acs.jxnu.edu.cn/problem/HDU1239A message from humans to extraterrestrial intelligence was sent through the Arecibo radio telescope in Puerto Rico on the afternoon of Saturday November 16, 1974. The message consisted of 1679 bits and was mean
2022-01-27 22:56:07
156
翻译 1.26题目翻译
题目链接：https://acs.jxnu.edu.cn/problem/HDU1227The fastfood chain McBurger owns several restaurants along a highway. Recently, they have decided to build several depots along the highway, each one located at a restaurant and supplying several of the restaur
2022-01-26 20:07:20
144
翻译 1.25题目翻译
原题链接：https://acs.jxnu.edu.cn/problem/HDU1213Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the
2022-01-25 19:32:18
321
翻译 1.24题目翻译
原题链接：Numeric Keypad_牛客题霸_牛客网题目：描述The numberic keypad on your mobile phone looks like below:1234567890suppose you are holding your mobile phone with single hand. Your thumb points at digit 1. Each time you can 1)press the digit your thumb pointing at.
2022-01-24 22:01:51
166
翻译 1.23题目翻译
题目链接：“蓝桥杯”练习系统原题George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the original state, but he forgot how many sticks he had originally and how long they were origin
2022-01-23 22:09:07
337
翻译 1.22题目翻译
题目链接Machine Schedule | JXNUOJ题目：As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of the constraints that must be satisfied a
2022-01-22 21:09:45
192
翻译 1.21题目翻译
题目链接：Ignatius and the Princess III | JXNUOJ题目："Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says."The second problem is, given an positive integer N, we define an equation like this:N=a[1]+a[2..
2022-01-21 19:51:24
143
翻译 1.20题目翻译
题目链接：Biker's Trip Odometer | JXNUOJ题目：Most bicycle speedometers work by using a Hall Effect sensor fastened to the front fork of the bicycle. A magnet is attached to one of the spokes on the front wheel so that it will line up with the Hall Effect swit
2022-01-20 20:43:19
154
翻译 1.19题目翻译
题目链接：Tempter of the Bone | JXNUOJThe 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 was a trap, and he tr
2022-01-19 22:22:34
75
翻译 英语题目翻译
1.18题目链接Number Sequence | JXNUOJ题目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 multiple test cases. Each te
2022-01-18 18:26:54
88
翻译 英语题目翻译
1.17题目链接：Design T-Shirt | JXNUOJ题目：Soon after he decided to design a T-shirt for our Algorithm Board on Free-City BBS, XKA found that he was trapped by all kinds of suggestions from everyone on the board. It is indeed a mission-impossible to have everybo
2022-01-17 18:29:32
143
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人