lijuntao.boke-CSDN博客

Farmer John's farm was flooded in the most recent storm, a fact only aggravated by the information that his cows are deathly afraid of water. His insurance agency will only repay him, however, an amount depending on the size of the largest "lake" on his fa

2022-02-17 22:51:51 295

原创 2.16([Usaco2005 Nov]Ant Counting)

描述Bessie was poking around the ant hill one day watching the ants march to and fro while gathering food. She realized that many of the ants were siblings, indistinguishable from one another. She also realized the sometimes only one ant would go for food,

2022-02-16 20:42:07 946

原创 2.15(Multiple of 3 Or 5)

https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH23描述：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.样例输入：100样例输出：46翻译:

2022-02-15 09:14:59 159

原创 2.14(Knight Moves)

http://noi.openjudge.cn/ch0205/917/描述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..

2022-02-14 19:36:52 78

原创 2.13(Mode of Sequence)

https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH27描述：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 positiv

2022-02-13 11:01:37 220

原创 2.12(Zju2061 Buy the Ticket)

http://noi.openjudge.cn/ch0206/9288/描述The "Harry Potter and the Goblet of Fire" will be on show in the next few days. As a crazy fan of Harry Potter, you will go to the cinema and have the first sight, won't you?Suppose the cinema only has one ticket-

2022-02-12 09:45:10 381

原创 2.11（Pku2680 Computer Transformation）

http://noi.openjudge.cn/ch0206/9290/描述A sequence consisting of one digit, the number 1 is initially written into a computer. At each successive time step, the computer simultaneously tranforms each digit 0 into the sequence 1 0 and each digit 1 into th

2022-02-11 22:03:09 214

原创 2.10(Channel Allocation)

http://noi.openjudge.cn/ch0205/131/描述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 chos

2022-02-10 09:14:20 158

原创 2.9(Clear Cold Water)

http://noi.openjudge.cn/ch0306/2392/描述The steamy, sweltering summers of Wisconsin's dairy district stimulate the cows to slake their thirst. Farmer John pipes clear cold water into a set of N (3 <= N <= 99999; N odd) branching pipes conveniently

2022-02-09 21:25:30 455

原创 2.8(Knight Moves)

http://noi.openjudge.cn/ch0205/917/描述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

2022-02-08 19:08:44 90

原创 2.7(Sum is K)

https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH15描述：Given a sequence of N numbers. Find different numbers A and B in the sequence so that the sum of A and B equals to K.输入：First line: two positive integers N (N <= 1000) and K (K <= 1000000).Se

2022-02-07 10:25:28 439

原创 2.6(Children‘s Apples)

Children's Apples | JXNUOJ描述：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) a

2022-02-06 22:16:27 287

原创位运算常用

lowbit:x&-x;(用于求数的最后一个1,ps:x用二进制表示中最后一个1)x>>k&1;(求x的第k位数字,ps:x用二进制数表示)

2022-02-05 15:13:28 166

原创 2.5(Same Remainder)

https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH13描述：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.样例输入：17 26样例输出：3翻译

2022-02-05 09:09:52 279

原创 1.28(Safecracker)

OpenJudge - 250: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 f

2022-01-28 17:31:21 308

原创 1.27(Bomb Game)

http://noi.openjudge.cn/ch0201/1661/描述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 se

2022-01-27 20:42:45 756

原创 1.26(Least Common Multiple)

描述：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.样例输入：8 12样例输出：24翻译:描述:给数字A和B，求出a和B的公倍数的最小正整数M。输入：两个正整数A,B(A,B <= 100

2022-01-26 09:23:23 459

原创二维数组的前缀和

左上角坐标(x1,y1)，右下角坐标(x2,y2)。S为二维数组的前缀和数组。求和：S[x2][y2]-S[x2][y1-1]-S[x1-1][y2]+S[x1-1][y1-1];S[i][j]=a[i][j]-S[i-1][j-1]+S[i-1][j]+S[i][j-1];

2022-01-25 21:47:36 483

原创 1.25(Greatest Common Divisor)

描述：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.样例输入：18 24样例输出：6翻译:描述：给个数字A和B，找出a和B的公约数中最大的D。输入：两个正整数A和B(A,B <= 10000).输

2022-01-25 09:31:42 158

原创 1.24(Shortest Path)

Shortest Path | JXNUOJ描述：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 N lines: the

2022-01-24 10:06:32 339

原创 1.23(N Queens)

https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH06描述：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

2022-01-23 10:34:16 155

原创 1.22(Grocery Problem)

https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH05描述：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, indicat..

2022-01-22 14:07:43 187

原创 1.21(0/1 Knapsack)

https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH04描述：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.

2022-01-21 10:23:04 296

原创 1.20(Magic Sequence)

链接：https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH03描述：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 .

2022-01-20 08:49:19 212

原创 1.19（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 banana cake is 40. And we have 4000 flour, 6 bananas,

2022-01-19 09:21:25 503

原创 1.18(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.输入：First line: one positive integer N (N <= 20).Next

2022-01-18 09:07:09 279

原创 1.17(Treasure the new start, freshmen)

描述：background:A new semester comes , and the HDU also meets its 50th birthday. No matter what's your major, the only thing I want to tell you is:"Treasure the college life and seize the time." Most people thought that the college life should be colorful

2022-01-17 09:08:20 322

原创 1.16英文翻译(Counterfeit Dollar)

样例：描述：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

2022-01-16 17:30:18 207

weixin_44746864的博客

原创 vr射线控制

原创 unity 空气墙脚本

原创 unity存储系统(Save)

原创 unity 存储系统(PlayerPrefs)

原创 2.17(Avoid The Lakes)