- 博客(30)
- 收藏
- 关注
RSS订阅翻译 Tick and Tick（https://acs.jxnu.edu.cn/problem/HDU1006/editor）
题目：Tick and Tick描述：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 happy if it is at least D deg
2022-02-10 23:53:05
181
翻译 Big Number（https://acs.jxnu.edu.cn/problem/HDU1018/editor）
题目：Big Number描述：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 have to determine the number of dig
2022-02-10 23:29:57
122
翻译 Number Sequence（https://acs.jxnu.edu.cn/problem/HDU1005）
题目：Number Sequence1000ms32768K描述：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....
2022-02-10 23:04:58
147
翻译 Let the Balloon Rise（https://acs.jxnu.edu.cn/problem/HDU1004/editor）
题目：Let the Balloon Rise描述：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 balloons of each
2022-02-10 22:37:59
129
翻译 Max Sum（https://acs.jxnu.edu.cn/problem/HDU1003）
题目：Max Sum1000ms32768K描述：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 inpu...
2022-02-10 22:11:11
144
翻译 Delta-wave（https://acs.jxnu.edu.cn/problem/HDU1030）
题目：Delta-wave1000ms32768K描述：A triangle field is numbered with successive integers in the way shown on the picture below.The traveller needs to go from the cell with number M to the cell with number N. The traveller is able to enter the...
2022-02-09 22:55:09
93
翻译 Charging（https://acs.jxnu.edu.cn/problem/ICPCJX2020C）
题目：Charging1000ms131072K描述：Xxy is the king of the universe. In order to resist the invasion, he ordered the construction of many space warships.Now,he wants to charge his space ships.He hasNspace ships.TheNships are numbered from1toNan...
2022-02-09 22:22:40
175
翻译 Apple（https://acs.jxnu.edu.cn/problem/ICPCJX2020B）
题目：Apple1000ms262144K描述：There are a box of apples,which containsNapples. You're going to give them toMperson. It is required that everyone must be given a positive integer apple, and no one must have the same amount. If it can be done, outpu...
2022-02-06 23:01:40
121
翻译 A Simple Math Problem（https://acs.jxnu.edu.cn/problem/ICPCJX2020A）
题目：A Simple Math Problem1000ms131072K描述：Huanhuan challenges you to a simple math problem.DefineF(x)F(x)as the sum of the decimal digits ofxx.For example:F(123)=1+2+3=6F(123)=1+2+3=6,F(700)=7+0+0=7F(700)=7+0+0=7.Huanhuan wants you to c...
2022-02-06 22:47:02
115
翻译 Lake Counting（https://acs.jxnu.edu.cn/problem/NOIOPJCH02051388）
题目：Lake Counting1000ms65536K描述：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...
2022-02-05 22:39:02
83
翻译 Dungeon Master（https://acs.jxnu.edu.cn/problem/NOIOPJCH02051253）
题目：Dungeon Master1000ms65536K描述：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,...
2022-02-05 22:05:21
115
翻译 Going to the Movies（https://acs.jxnu.edu.cn/problem/NOIOPJCH02072393）
题目：Going to the Movies10000ms1000K描述：Farmer John is taking some of his cows to the movies! While his truck has a limited capacity of C (100 <= C <= 5000) kilograms, he wants to take the cows that, in aggregate, weigh as much as possible wi...
2022-01-29 22:12:59
135
翻译 Sumsets（https://acs.jxnu.edu.cn/problem/NOIOPJCH03051551）
题目：Sumsets1000ms 65536K描述：Given S, a set of integers, find the largest d such that a + b + c = d where a, b, c, and d are distinct elements of S.输入：Several S, each consisting of a line containing an integer 1 <= n <= 1000 indicating the n
2022-01-28 22:44:48
78
翻译 Sticks（https://acs.jxnu.edu.cn/problem/NOIOPJCH040713/editor）
题目：Sticks描述：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 original
2022-01-27 22:59:00
98
翻译 Post Office（https://acs.jxnu.edu.cn/problem/NOIOPJCH0206162/editor）
题目：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 po
2022-01-26 21:28:25
154
翻译 Maze（https://acs.jxnu.edu.cn/problem/NOIOPJCH02051159）
题目：Maze2000ms65536K描述：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 n...
2022-01-25 21:37:35
125
翻译 Teamwork（https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH21）
题目：Teamwork1000ms65536K描述：There are N candidates. Each candidate has a cooperation value and a working value. Select a subset of candidates to form a team, such that the sum of cooperation values is positive and the sum of working values is maxi...
2022-01-24 23:03:08
190
翻译 Counterfeit Dollar（https://acs.jxnu.edu.cn/problem/NOIOPJCH020115）
题目：Counterfeit Dollar1000ms65536K描述：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...
2022-01-23 21:20:41
90
翻译 Monitor（https://acs.jxnu.edu.cn/contest/22/board/challenge/D）
题目：Monitor描述：Reca company makes monitors, the most popular of their models is AB999 with the screen sizea × bcentimeters. Because of some production peculiarities a screen parameters are integer numbers. Recently the screen sides ratiox: ybecame...
2022-01-22 20:59:42
141
翻译 Goldbach‘s Conjecture(https://acs.jxnu.edu.cn/contest/22/board/challenge/B)
题目：Goldbach's Conjecture描述：In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:Every even number greater than 4 can bewritten as the sum of two odd prime numbers.
2022-01-22 18:41:40
113
翻译 Burglar and Matches（https://acs.jxnu.edu.cn/contest/22/board/challenge/A）
题目：Burglar and MatchesA burglar got into a matches warehouse and wants to steal as many matches as possible. In the warehouse there aremcontainers, in thei-th container there areaimatchboxes, and each matchbox containsbimatches. All the matchbox...
2022-01-22 11:32:40
144
翻译 Back Home（https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH36）
题目：Back Home1000ms65536K描述：There are N cities in the graph. Given the edges between the cities. Can you find a path from city 1 to city N?输入：First line: one positive integers N (N <= 100).Next N lines: an N*N 0/1 matrix A={a[i][j]}, indi...
2022-01-21 21:42:05
121
翻译 Coins（https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH18）
题目：Coins1000ms65536K描述：There are N kinds of coins. Each kind of coins has a value V and a weight W. Tony wants to go traveling. Unfortunately, he can only carry coins of which the total weight is not greater than K. How much total value of coins...
2022-01-20 20:22:10
184
翻译 Shortest Path（https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH07）
题目：Shortest Path1000ms65536K描述：There is a graph with N nodes. Given the length of each edge between the nodes. Find the shortest path from S to E.输入：First line: three positive integer number N (N <= 100), S (S <= N), E(E <= N).Next...
2022-01-19 20:27:41
78
翻译 N Queens(https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH06)
题目：N Queens1000ms65536K描述：Determine the columns of N queens should be place on. Columns should be greater than 1 and less than N. Columns should be all different. Each column plus its index should be different from others. Each column minus its ...
2022-01-19 20:11:15
92
翻译 Grocery Problem（https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH05）
题目：Grocery Problem1000ms65536K描述：Find the prices of 4 items so that the sum of prices is 711 and the product of prices is 711000000. The prices of items are in ascending order.输入：N/A输出：One line contains four integers, indicating the pric...
2022-01-17 20:22:00
152
翻译 0/1 Knapsack（https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH04）
题目：0/1 Knapsack1000ms65536K描述：Given the weights and values of N items, put a subset of items into a knapsack of capacity C to get the maximum total value in the knapsack. The total weight of items in the knapsack does not exceed C.输入：First l...
2022-01-17 20:18:38
93
翻译 Magic Sequence（https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH03）
题目：Magic Sequence1000ms65536K描述：Find a sequence of N numbers. Each number is equal to the count of (its index minus 1) in the sequence.输入：One positive integer N (N <= 10).输出：N lines: the i-th line contains one integer indicating the i...
2022-01-17 20:14:41
202
翻译 Cake Baking（https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH02）
描述：做一个香蕉蛋糕需要250克面粉，2个香蕉，75克糖和100克黄油，并且做一个巧克力蛋糕要200克面粉，75克可可粉，150克糖和150克黄油，一个巧克力蛋糕的利润是45元并且一个香蕉蛋糕的利润是40.我们现在有4000克面粉，6个香蕉，2000克糖，500克黄油和500克可可粉。问题是我们为宴会做多少个香蕉蛋糕和巧克力蛋糕使得总利润达到最大化。输入：N/A输出：第一行：一个整数，表示巧克力蛋糕的数量。第二行：一个整数，表示香蕉蛋糕的数量。样例输入：N/A样例输出：
2022-01-17 18:22:56
664
翻译 【无标题】Map Coloring（https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH01）
描述：给出一个有N个节点的图表的边，有三种颜色用来画节点，决定每个节点的颜色，每个边的各个节点的颜色应该是不同的。输入：第一行：一个正整数N（N<=20）接下来的N行：一个N*N 的矩阵0/1 A={a[i][j]}表示是否在节点i和节点j之间存在一个边，使（a[i][j]=1）或（a[i][j]=0）。输出：N行，第i行包含一个整数c[i]表示第i个节点的颜色（c[i]=1,2,或3）。样例输入：40 1 0 11 0 1 00 1 0 11 0 1
2022-01-17 18:18:23
190
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人