- 博客(57)
- 收藏
- 关注
RSS订阅翻译 Flower HDU - 6486
Rabbit loves flowers very much and she plants n pots of flowers in her house. But she never prunes them because she is lazy. So the flowers have different heights and look ugly. One day, Kayaking decides to prune the flowers to make them look beautiful. T.
2020-06-01 00:02:46
208
原创 A Count Task HDU - 6480
Count is one of WNJXYK’s favorite tasks. Recently, he had a very long string and he wondered that how many substrings which contains exactly one kind of lowercase in this long string. But this string is so long that he had kept counting for several days. .
2020-05-31 23:22:05
222
原创 Count Triangles CodeForces - 1355C
Like any unknown mathematician, Yuri has favourite numbers: AA , BB , CC , and DD , where A≤B≤C≤DA≤B≤C≤D . Yuri also likes triangles and once he thought: how many non-degenerate triangles with integer sides xx , yy , and zz exist, such that A≤x≤B≤y≤C≤z≤DA.
2020-05-24 23:48:55
215
原创 Sequence with Digits CodeForces - 1355A
Let's define the following recurrence:an+1=an+minDigit(an)⋅maxDigit(an).an+1=an+minDigit(an)⋅maxDigit(an).Here minDigit(x)minDigit(x) and maxDigit(x)maxDigit(x) are the minimal and maximal digits in the decimal representation of xx without leading zer.
2020-05-24 23:29:17
184
转载 LCM from 1 to n LightOJ - 1289
Given an integer n, you have to findlcm(1, 2, 3, ..., n)lcm means least common multiple. For example lcm(2, 5, 4) = 20, lcm(3, 9) = 9, lcm(6, 8, 12) = 24.InputInput starts with an integer T (≤ 10000), denoting the number of test cases.Each case..
2020-05-17 22:08:22
156
原创 Enlarge GCD CodeForces - 1034A
Mr. F has nn positive integers, a1,a2,…,ana1,a2,…,an .He thinks the greatest common divisor of these integers is too small. So he wants to enlarge it by removing some of the integers.But this problem is too simple for him, so he does not want to do it.
2020-05-17 21:58:11
313
翻译 Find them, Catch them POJ - 1703 （带权并查集）
The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which gang a criminal belongs to. The present question is, giv.
2020-05-10 22:03:47
175
原创 Borg Maze POJ - 3026 （最小生成树+广）
The Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg civilization. Each Borg individual is linked to the collective by a so.
2020-05-10 21:53:31
142
翻译 Tautology POJ - 3295
WFF 'N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Well-formed formula (WFF) is any string of the...
2020-04-26 21:57:39
172
翻译 Snowflake Snow Snowflakes POJ - 3349
You may have heard that no two snowflakes are alike. Your task is to write a program to determine whether this is really true. Your program will read information about a collection of snowflakes, and...
2020-04-26 21:51:58
162
原创 凸包问题----总结长度和面积
凸包详解地址： https://www.cnblogs.com/wpbing/p/9456240.htmlA - Surround the TreesZOJ - 1453 There are a lot of trees in an area. A peasant wants to buy a rope to surround all these trees. So ...
2020-04-19 22:31:30
418
原创 I'm Telling the Truth
After this year’s college-entrance exam, the teacher did a survey in his class on students’ score. There are n students in the class. The students didn’t want to tell their teacher their exact score;...
2020-04-12 21:55:14
247
原创 poj 1469 COURSES（模板题）
Consider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of exactly P students that s...
2020-04-12 21:02:37
159
翻译 过山车（二分图最大匹配）
RPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有两个座位，而且还有条不成文的规矩，就是每个女生必须找个个男生做partner和她同坐。但是，每个女孩都有各自的想法，举个例子把，Rabbit只愿意和XHD或PQK做partner，Grass只愿意和linle或LL做partner，PrincessSnow愿意和水域浪子或伪酷儿做partner。考...
2020-04-12 20:46:27
140
原创 KMP：Count the string HDU - 3336 Simpsons’ Hidden Talents HDU - 2594
Count the stringHDU - 3336 It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of thi...
2020-04-12 20:26:26
128
原创 确定比赛名次 HDU - 1285（拓扑排序）
有N个比赛队（1<=N<=500），编号依次为1，2，3，。。。。，N进行比赛，比赛结束后，裁判委员会要将所有参赛队伍从前往后依次排名，但现在裁判委员会不能直接获得每个队的比赛成绩，只知道每场比赛的结果，即P1赢P2，用P1，P2表示，排名时P1在P2之前。现在请你编程序确定排名。Input输入有若干组，每组中的第一行为二个数N（1<=N<=500），M；其中N表...
2020-04-05 21:49:54
171
原创 Fibonacci again and again HDU - 1848 （博弈）
任何一个大学生对菲波那契数列(Fibonacci numbers)应该都不会陌生，它是这样定义的：F(1)=1;F(2)=2;F(n)=F(n-1)+F(n-2)(n>=3);所以，1,2,3,5,8,13……就是菲波那契数列。在HDOJ上有不少相关的题目，比如1005 Fibonacci again就是曾经的浙江省赛题。今天，又一个关于Fibonacci的题目出现了，它是一个...
2020-03-29 20:57:41
128
原创 概率期望dp
A - Collecting BugsIvan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he classifies all...
2020-03-29 20:10:01
257
原创 (kmp) Number Sequence
Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K...
2020-03-28 17:16:08
99
原创 Max Sum Plus Plus HDU - 1024
Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem....
2020-03-27 21:49:18
276
翻译 蒙特卡罗法
蒙特卡罗法（Monte Carlo method）是以概率和统计的理论、方法为基础的一种计算方法，将所求解的问题同一定的概率模型相联系，用电子计算机实现统计模拟或抽样，以获得问题的近似解，故又称统计模拟法或统计试验法。蒙特卡罗算法在一般情况下可以保证对问题的所有实例都以高概率给出正确解，但是通常无法判定一个具体解是否正确。设p是一个实数，且1/2 <p <1。如果一个蒙特卡罗算...
2020-03-27 21:20:26
654
翻译 Cheapest Palindrome POJ - 3280
Keeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID tag that the system will read as the cows pass by...
2020-03-22 21:53:22
106
翻译 Ehab the Xorcist CodeForces - 1325D
Given 2 integers uu and vv, find the shortest array such that bitwise-xor of its elements is uu, and the sum of its elements is vv.InputThe only line contains 2 integers uu and vv (0≤u,v≤1018)(0≤u...
2020-03-22 21:12:31
216
原创 The Suspects
Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to ...
2020-02-11 20:41:55
151
原创 C - Platforms Jumping CodeForces - 1256C（贪心）
There is a river of width nn . The left bank of the river is cell 00 and the right bank is cell n+1n+1 (more formally, the river can be represented as a sequence of n+2n+2 cells numbered from 00 to n+...
2019-11-09 09:59:05
271
翻译 CodeForces - 1249D2 Too Many Segments (hard version)(容器(vector,set))
The only difference between easy and hard versions is constraints.You are given nn segments on the coordinate axis OXOX . Segments can intersect, lie inside each other and even coincide. The ii -th ...
2019-11-04 19:58:50
261
翻译 E - Good Numbers (hard version) CodeForces - 1249C2
The only difference between easy and hard versions is the maximum value of nn .You are given a positive integer number nn . You really love good numbers so you want to find the smallest good number ...
2019-11-04 19:33:59
216
翻译 H - By Elevator or Stairs? CodeForces - 1249E
You are planning to buy an apartment in a nn -floor building. The floors are numbered from 11 to nn from the bottom to the top. At first for each floor you want to know the minimum total time to reach...
2019-11-04 19:00:52
128
翻译 Books Exchange (hard version) CodeForces - 1249B2
Time limit1000 msMemory limit262144 kB SourceCodeforces Round #595 (Div. 3)The only difference between easy and hard versions is constraints.There are nn kids, each of them is rea...
2019-11-01 20:54:38
354
1
翻译 Minimizing Difference CodeForces - 1244E
You are given a sequence a1,a2,…,ana1,a2,…,an consisting of nn integers.You may perform the following operation on this sequence: choose any element and either increase or decrease it by one.Calc...
2019-10-18 21:46:43
268
原创 食物链 POJ - 1182 （并查集）
动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。有人用两种说法对这N个动物所构成的食物链关系进行描述：第一种说法是"1 X Y"，表示X和Y是同类。第二种说法是"2 X Y"，表示X吃Y。此人对N个动物，用上述两种说法，一句接一句地说出K句话...
2019-08-18 17:34:47
128
原创 GCD - Extreme (II) UVA - 11426 (欧拉函数)
Given the value of N, you will have to find the value of G. The definition of G is given below: Here GCD(i, j) means the greatest comm...
2019-08-17 19:40:35
117
翻译 Play on Words HDU - 1116 （欧拉通路）
DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzl...
2019-08-10 10:55:01
156
翻译 Card Game Cheater HDU - 1962 （二分图最大匹配）
DescriptionAdam and Eve play a card game using a regular deck of 52 cards. The rules are simple. The players sit on opposite sides of a table, facing each other. Each player gets k cards from the ...
2019-08-10 09:36:10
111
翻译 XYZZY HDU - 1317 （最长路+SPFA）
It has recently been discovered how to run open-source software on the Y-Crate gaming device. A number of enterprising designers have developed Advent-style games for deployment on the Y-Crate. Your ...
2019-08-09 21:14:25
130
翻译 Longest Paths UVA - 10000
It is a well known fact that some people do not have their social abilities completely enabled. One example is the lack of talent for calculating distances and intervals of time. This causes some pe...
2019-08-09 20:27:58
103
原创 Trees on the level HDU - 1622
Trees are fundamental in many branches of computer science. Current state-of-the art parallel computers such as Thinking Machines' CM-5 are based on fat trees. Quad- and octal-trees are fundamental t...
2019-08-08 20:27:30
173
翻译 Elven Postman HDU - 5444
DescriptionElves are very peculiar creatures. As we all know, they can live for a very long time and their magical prowess are not something to be taken lightly. Also, they live on trees. However, ...
2019-08-08 10:03:55
119
翻译 A Walk Through the Forest HDU - 1142 （最短路径+记忆化搜索）
Problem DescriptionJimmy experiences a lot of stress at work these days, especially since his accident made working difficult. To relax after a hard day, he likes to walk home. To make things even...
2019-08-05 15:54:08
152
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人