ice23378-CSDN博客

原创 Reverse Pair（http://noi.openjudge.cn/english/32/）

原文：描述Given a sequence S of N numbers. How many pairs of indexes I and J are there satisfying that I is less than J and S[i] is greater than S[J]?输入First line: one positive integers N (N <= 100).Second line: N positive integers (<= 1000).输出

2022-02-16 10:06:38 103

原创 Candies（http://noi.openjudge.cn/english/31/）

原文：描述There are N bags. Each bag has some candies. You can take some of the bags. the total number of candies in these bags should be a multiple of K because you want to divide the candies equally between K friends. How many candies can you take at most

2022-02-16 09:58:22 90

原创 Exactly Equal（http://noi.openjudge.cn/english/30/）

原文：描述Find a subset of N numbers. The sum of the numbers in the subset is exactly equal to T.输入First line: two positive integers N (N <= 100) and T (T <= 1000).Second line: N positive integers (<= 1000).输出One line contains several numb

2022-02-16 09:52:22 103

原创 Divisor Problem（http://noi.openjudge.cn/english/29/）

原文：描述Find the minimum positive number A, so that both A and (M minus A) are divisors of N.输入Two positive integers N (N <= 10000) and M (M <= 10000).输出Two integers A and (M-A).翻译：描述：求最小正数 a，使得 a 和(m-a)都是 n 的约数。输入：两个正整数N和M（小于等与1

2022-02-15 22:19:11 70

原创 Sun number(http://noi.openjudge.cn/english/28/)

原文：描述Given a sequence of N number. How many numbers in the sequence are there which equal to the sum of two different numbers in the sequence.输入First line: one positive integers N (N <= 100).Second line: N positive integers (<= 100000).输出

2022-02-15 22:16:19 80

原创 Mode of Sequence（http://noi.openjudge.cn/english/27/）

原文：描述Given a sequence of N number. Find the mode M in the sequence so that the number of M's appear in the sequence is maximum.输入First line: one positive integers N (N <= 100).Second line: N positive integers (<= 100000).输出One integer M.

2022-02-13 17:42:05 371

原创 Teamwork（http://noi.openjudge.cn/english/21/）

原文：描述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 maximum.输入First line: one po

2022-02-13 16:54:34 175

原创 Messager Problem（http://noi.openjudge.cn/english/20/）

原文：描述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.输入First line: one positive integer N (N <= 15).Next N lines: the i-th line contains N

2022-02-11 18:20:02 192

原创 Cake Baking（http://noi.openjudge.cn/english/02/）

原文：描述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 banana cake is 40. And we have 4000 flour, 6 bana

2022-02-11 18:07:15 150

原创 0/1 Knapsack（http://noi.openjudge.cn/english/04/）

原文：描述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 line: two positive integers N (N &

2022-02-10 20:20:29 543

原创 Indeterminate Equation（http://noi.openjudge.cn/english/22/）

原文：描述Given A, B and C. Find X and Y so that A times X plus B times Y equals to C.输入Three positive integer A, B, C (A, B, C <= 100).输出Two integers X and Y.翻译：描述：给定 a，b 和 c，求 x 和 y， a 乘以 x 加上 b 乘以 y 等于 c。输入：三个正整数A，B，C（小于等与100）

2022-02-10 19:57:22 172

原创 Multiple of 3 Or 5（http://noi.openjudge.cn/english/23/）

原文：描述How many positive integers are there which is less than N and is a multiple of 3 or a multiple of 5.输入One positive integer N (N <= 100000).输出One integer.翻译：描述：有多少个小于N的正整数是3的倍数或5的倍数输入：一个正整数N（小于等与100000输出一个整数...

2022-02-10 19:49:34 83

原创 Divisor and Multiple（http://noi.openjudge.cn/english/24/）

原文：描述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.输入Two positive integer D and M (D,M <= 100).输出Two integers A and B.翻译：乘和除描述：给出D和M，D是A和B的商，M是A和B的积输入：两个正整数D和M（小于等与100

2022-02-09 20:31:21 306

原创 Duplicate Number（http://noi.openjudge.cn/english/19/）

原文描述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).Second line: N positive integers (<= 1000000).输出One integer A.翻译：描述：给出一个N个数的数

2022-02-08 10:42:32 432

原创 Coins（http://noi.openjudge.cn/english/18/）

原文：描述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 can he carry at most?输

2022-02-07 09:23:01 308

原创 Children‘s Apples（http://noi.openjudge.cn/english/14/）

原文：描述There are N children. Each child has a positive number, and the numbers are different from each other. Given the sum of all numbers of children. Find a possible assignment.输入Two positive integers N (N <= 10) and the sum (sum <= 10000).

2022-02-02 16:22:34 170

原创 Same Remainder（http://noi.openjudge.cn/english/13/）

原文：描述Given A and B. Find the smallest X that X is greater than 1 and A modulo X equals to B modulo X.输入Two positive integers A and B (A,B <= 10000).输出One integer X.翻译：描述：给出A和B，求最小的x（x大于1并且A对x取模等与B对x取模）输入：两个正整数A和B（A和B都小于等与10000）

2022-02-02 16:10:25 154

原创 Maximum Product of Sequence（http://noi.openjudge.cn/english/12/）

原文：描述Find a sequence of M positive numbers with the maximum product, while the sum of them is N.输入Two positive integers M (M <= 10) and N (N <= 100).输出One line contains M integers.翻译：描述：找出m个正整数的最大乘积，这m个数的和是n输入：两个正整数m和n（m<

2022-01-27 17:07:19 270

原创 Chickens and Rabbits（http://noi.openjudge.cn/english/10/）

原文：10:Chickens and Rabbits总时间限制:1000ms内存限制:65536kB描述In the yard were C chickens and R rabbits. Each chicken has one head and two legs. Each rabbit has one head and four legs. There are total 27 heads and 86 legs in the yard. Calculate

2022-01-27 12:04:41 282

原创 Least Common Multiple（http://noi.openjudge.cn/english/09/）

原文：描述Given A and B. Find the least positive M which is a common multiple of both A and B.输入Two positive integers A and B (A,B <= 10000).输出One integer M.翻译：描述：给出A和B，找出A和B的最小公倍数M输入：两个正整数A和B（都小于10000输出一个正整数M...

2022-01-19 18:02:05 244

原创 Greatest Common Divisor（http://noi.openjudge.cn/english/08/）

原文：描述Given A and B. Find the greatest D which is a common divisor of both A and B.输入Two positive integers A and B (A,B <= 10000).输出One integer D.翻译：描述：给定 a 和 b，求 a 和 b 的公约数的最大 d。输入：两个正整数a和b，a和b都小于等与10000输出：一个整数d...

2022-01-18 19:22:43 230

原创 Magic Sequence（http://noi.openjudge.cn/english/03/）

原题：描述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-th number in the sequence.翻译：

2022-01-17 16:43:53 245

原创 Sequence Search（https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH25）

原题：Sequence Search1000ms 65536K描述：Given a sequence S of N numbers. Find the least index id so that S[id] equals to K.输入：First line: two positive integers N (N <= 100) and K (K <= 100000).Second line: N positive integers (<= 100000).

2022-01-16 17:51:13 100

原创 Goldbach Conjecture（https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH11）

原题：Goldbach Conjecture1000ms65536K描述：Given the sum of prime A and prime B, find A and B.输入：One positive integer indicating the sum (<= 10000).输出：Two integers A and B.样例输入：10样例输出：3 7...

2022-01-14 20:15:09 152

ice23378的博客