R_xin_-CSDN博客

翻译 Divisibility（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH0206747）

描述：Consider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expressions that evaluate to different values. Let us, for example, take the sequence: 17, 5, -21, 15. Th

2022-02-12 10:10:33 152

翻译 Charm Bracelet（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH02067113）

描述：Bessie has gone to the mall's jewelry store and spies a charm bracelet. Of course, she'd like to fill it with the best charms possible from theN(1 ≤N≤ 3,402) available charms. Each charmiin the supplied list has a weightWi(1 ≤Wi≤ 400), a 'desirab...

2022-02-11 16:28:03 215

翻译 Exchange Rates（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH02062421）

描述：Now that the Loonie is hovering about par with the Greenback, you have decided to use your $1000 entrance scholarship to engage in currency speculation. So you gaze into a crystal ball which predicts the closing exchange rate between Canadian and U.S.

2022-02-10 16:32:34 245

翻译 Post Office（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH0206162）

Post Office描述:There is a straight highway with villages alongside the highway. The highway is represented as an integer axis, and the position of each village is identified with a single integer coordinate There are no two villages in the same position.

2022-02-09 16:12:28 155

翻译 Pots（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH02052152）

描述：You are given two pots, having the volume ofAandBliters respectively. The following operations can be performed:FILL(i) fill the poti(1 ≤i≤ 2) from the tap; DROP(i) empty the potito the drain; POUR(i,j) pour from potito ...

2022-02-08 13:15:00 164

翻译 Knight Moves（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH0205917）

描述：BackgroundMr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him?The ProblemYour task is to write a program to calculate the minimum number of moves needed fo

2022-02-08 10:15:00 181

翻译 Solitaire题目地址链接（https://acs.jxnu.edu.cn/problem/NOIOPJCH0205200）

描述：Solitaire is a game played on a chessboard 8x8. The rows and columns of the chessboard are numbered from 1 to 8, from the top to the bottom and from left to right respectively.There are four identical pieces on the board. In one move it is allowed to:

2022-02-06 12:45:00 133

翻译 The Castle(题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH0205166）

描述：1234567#############################1#|#|#||######---#####---#---#####---#2##|######---#####---#####---#####---#3#||######---#########---##...

2022-02-05 11:45:00 94

翻译 Lake Counting （题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH02051388）

描述：Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains either water ('W') or dry land ('.'). Farmer John w..

2022-01-28 16:05:04 130

翻译 Channel Allocation（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH0205131）

描述：When a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a strong signal. However, the channels used by each repeater must be carefully chosen so that nearby repeaters do not i

2022-01-27 17:45:17 89

翻译 Flip Game（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH0201755）

描述：Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it's black or white side up. Each round you flip 3 to 5 pi

2022-01-26 10:46:43 253

翻译 Dungeon Master(题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH02051253）

描述：You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit north, south, east, west, up or down. You cannot move diagonall

2022-01-25 17:45:00 313

翻译 LETTERS(题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH0205156)

描述：A single-player game is played on a rectangular board divided in R rows and C columns. There is a single uppercase letter (A-Z) written in every position in the board.Before the begging of the game there is a figure in the upper-left corner of the boa

2022-01-25 17:15:00 116

翻译 The Skyline Problem(题目地址链接：https://leetcode.com/problems/the-skyline-problem/）

A city'sskylineis the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Given the locations and heights of all the buildings, returntheskylineformed by these buildings collectively.The geometric in...

2022-01-23 18:05:26 100

翻译 Maze（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH02051159）

描述：Acm, a treasure-explorer, is exploring again. This time he is in a special maze, in which there are some doors (at most 5 doors, represented by 'A', 'B', 'C', 'D', 'E' respectively). In order to find the treasure, Acm may need to open doors. However,

2022-01-22 11:45:00 116

翻译 Bomb Game（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH02011661）

描述：Bosko and Susko are playing an interesting game on a board made of rectangular fields arranged in A rows and B columns.When the game starts, Susko puts its virtual pillbox in one field one the board. Then Bosko selects fields on which he will throw hi

2022-01-21 15:15:00 168

翻译 Counterfeit Dollar（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH020115）

描述：Sally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is counterfeit even though its color and size make it indistinguishable from the real silver dollars. The counterfeit coin has a diffe

2022-01-20 17:11:05 107

翻译 Safecracker（题目地址链接：https://acs.jxnu.edu.cn/problem/NOIOPJCH0201250）

Safecracker描述："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 and his factory, were destroyed in World War II. Fortunately old Brumbaugh from research kne

2022-01-19 09:30:00 849

翻译 1575.Count All Possible Routes(题目地址链接：https://leetcode.com/problems/count-all-possible-routes/)

You are given an array ofdistinctpositive integers locations wherelocations[i]represents the position of cityi. You are also given integersstart,finishandfuelrepresenting the starting city, ending city, and the initial amount of fuel you have, re...

2022-01-18 09:14:01 131

翻译 849.Maximize Distance to Closest Person（题目地址链接：https://leetcode.com/problems/maximize-distance-to-c）

You are given an array representing a row of seats where seats[i] = 1 represents a person sitting in the ith seat, and seats[i] = 0 represents that the ith seat is empty (0-indexed).There is at least one empty seat, and at least one person sitting...

2022-01-17 09:01:33 127

R_xin_的博客