weixin_60451158的博客

题目地址：https://acs.jxnu.edu.cn/problem/ICPCJX2020GMathematical Practice数学实践描述：Kamishirasawa Keine always says, "If you don't know what to do, why not give mathematical practice a try."Kamishirasawa Keine总是说：“如果你不知道去做什么，为什么不尝试去进行数学实践”However, Cirn

题目地址：https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH24Divisor and Multiple除数与倍数描述：Given D and M. D is the divisor of both A and B, while M is the multiple of both A and B. Find A and B.给出D和M。D是A和B的除数，M是A和B的倍数。找到A和B。输入：Two positive integer D and

题目地址：https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH23Multiple of 3 Or 53或5的倍数描述：How many positive integers are there which is less than N and is a multiple of 3 or a multiple of 5.有多少个小于N的正整数是3的倍数或5的倍数。输入：One positive integer N (N <= 100000

题目地址：https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH22Indeterminate Equation不定方程描述：Given A, B and C. Find X and Y so that A times X plus B times Y equals to C.给出A,B和C。找到X和Y。使A乘以X加B乘以Y等于C。输入：Three positive integer A, B, C (A, B, C <= 100).三

题目地址：https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH21Teamwork团队合作描述：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

题目地址：https://acs.jxnu.edu.cn/contest/24/board/challenge/AABC描述：Recently, the students of School 179 have developed a unique algorithm, which takes in a binary stringssas input. However, they soon found out that if some substringttofssis a palin...

题目地址：https://acs.jxnu.edu.cn/contest/24/board/challenge/CSorting by Swapping通过交换进行排序描述：Given a permutation of numbers from 1 to n, we can always get the sequence 1, 2, 3, ..., n by swapping pairs of numbers. For example, if the initial sequence is

题目地址：https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH20Messager Problem信使问题描述：There are N nodes in the graph. Given the length of edges between the nodes, find the shortest path of size N and the nodes in the path are all different.在图标里有N个节点。给出各个节

题目地址：https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH19Duplicate Number1000ms 65536K描述：Given a sequence of N numbers, find a number A that the count of A in the sequence is at least two.输入：First line: one positive integer N (N <= 1000).Secon

题目地址：https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH18Coins硬币描述：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

题目地址：https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH09Least Common Multiple最小共约数描述：Given A and B. Find the least positive M which is a common multiple of both A and B.给出A和B。在A和B中找到最小公约数M。输入：Two positive integers A and B (A,B <= 10000).两个

题目地址：https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH08Greatest Common Divisor最大公约数描述：Given A and B. Find the greatest D which is a common divisor of both A and B.给出A和B。在A和B中找到做大公约数D。输入：Two positive integers A and B (A,B <= 10000).两个正整数A和

题目地址：https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH07Shortest Path最短路径描述：There is a graph with N nodes. Given the length of each edge between the nodes. Find the shortest path from S to E.有一个有N个节点的图表。给出每个节点之间边长的长度。找到从到E的最短路径。输入：First line: t

题目地址：https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH06N QueensN皇后问题描述：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 differ

题目地址：Login | JXNUOJMonitor显示屏描述：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 sid..

题目地址：Login | JXNUOJGoldbach'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

题目地址：Login | JXNUOJBurglar and Matches盗贼和火柴描述：A 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 contains...

题目地址：​​​​​​Grocery Problem | JXNUOJGrocery Problem杂货问题1000ms 65536K描述：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.找到四个物品的价格以至于总价格为711和产品的价格为71100

题目地址：0/1 Knapsack | JXNUOJ0/1 Knapsack1000ms 65536K描述：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 ex

题目地址：Magic Sequence | JXNUOJMagic Sequence魔术般的序列描述：Find a sequence of N numbers. Each number is equal to the count of (its index minus 1) in the sequence.找一个N个数字的序列。每个数字等于序列中的计数(其索引减1)。输入：One positive integer N (N <= 10).一个正整数N （N <=

题目地址 Map Coloring | JXNUOJ​​​​​​翻译：Map Coloring地图填色描述：Given edges of a graph with N nodes. There are three colors that can be used for coloring nodes. Determine the color of each node so that the colors of nodes of each edge should be different..

题目地址：Cake Baking | JXNUOJ翻译：Cake Baking烤蛋糕描述：A banana cake takes 250 flour, 2 bananas, 75 sugar and 100 butter, and a chocolate cake takes 200 flour, 75 cocoa, 150 sugar and 150 butter. The profit of a chocolate cake is 45 and the profit of a ban