![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
乱搞
zuhiul
这个作者很懒,什么都没留下…
展开
-
encu 3263 丽娃河的狼人传说
丽娃河是华师大著名的风景线。但由于学校财政紧缺,丽娃河边的路灯年久失修,一到晚上就会出现走在河边要打着手电的情况,不仅非常不方便,而且影响安全:已经发生了大大小小的事故多起。方便起见,丽娃河可以看成是从 1 到 n 的一条数轴。为了美观,路灯只能安装在整数点上,每个整数点只能安装一盏路灯。经专业勘测,有 m 个区间特别容易发生事故,所以至少要安装一定数量的路灯,请问至少还要安装多少路灯。Input原创 2017-05-13 12:48:06 · 655 阅读 · 0 评论 -
poj 1958 Strange Towers of Hanoi
传送门。BackgroundCharlie Darkbrown sits in another one of those boring Computer Science lessons: At the moment the teacher just explains the standard Tower of Hanoi problem, which bores Charlie to dea...原创 2018-03-18 15:29:23 · 459 阅读 · 0 评论 -
hdu 1307 N-Credible Mazes
传送门。An n-tersection is defined as a location in n-dimensional space, n being a positive integer, having all non-negative integer coordinates. For example, the location (1,2,3) represents an n-tersec...原创 2018-03-04 11:23:37 · 250 阅读 · 0 评论 -
hdu 1220 Cube
传送门。Cowl is good at solving math problems. One day a friend asked him such a question: You are given a cube whose edge length is N, it is cut by the planes that was paralleled to its side planes int...原创 2018-02-14 11:43:13 · 181 阅读 · 0 评论 -
hdu 1217 Arbitrage
传送门。Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example, suppose that 1 US Dollar buys 0.5 ...原创 2018-02-14 11:20:59 · 148 阅读 · 0 评论 -
hdu 1216 Assistance Required
传送门。After the 1997/1998 Southwestern European Regional Contest (which was held in Ulm) a large contest party took place. The organization team invented a special mode of choosing those participants ...原创 2018-02-14 10:50:29 · 252 阅读 · 0 评论 -
hdu 1208 Pascal's Travels
An n x n game board is populated with integers, one nonnegative integer per square. The goal is to travel along any legitimate path from the upper left corner to the lower right corner of the board. T...原创 2018-02-13 18:59:28 · 193 阅读 · 0 评论 -
hdu 1130 How Many Trees?(大数板子)
传送门:点这里。A binary search tree is a binary tree with root k such that any node v reachable from its left has label (v) <label (k) and any node w reachable from its right has label (w) > label (k...原创 2018-02-10 18:24:11 · 164 阅读 · 0 评论 -
hdu 6025 Coprime Sequence
题目链接:点这里。Problem DescriptionDo you know what is called ``Coprime Sequence''? That is a sequence consists of n positive integers, and the GCD (Greatest Common Divisor) of them is equal to 1.“Coprime Se原创 2017-09-16 11:58:43 · 207 阅读 · 0 评论 -
poj 2739 Sum of Consecutive Prime Numbers
Some positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer have? For example, the integer 53 has two repres原创 2017-06-22 12:07:00 · 173 阅读 · 0 评论 -
poj 1658 Eva's Problem
Eva的家庭作业里有很多数列填空练习。填空练习的要求是:已知数列的前四项,填出第五项。因为已经知道这些数列只可能是等差或等比数列,她决定写一个程序来完成这些练习。Input第一行是数列的数目t(0 <= t <= 20)。以下每行均包含四个整数,表示数列的前四项。约定数列的前五项均为不大于10^5的自然数,等比数列的比值也是自然数。Output对输入的每个数列,输出它的前五项。Sample I原创 2017-06-21 22:46:34 · 470 阅读 · 0 评论 -
poj 1218 THE DRUNK JAILER
A certain prison contains a long hall of n cells, each right next to each other. Each cell has a prisoner in it, and each cell is locked.One night, the jailer gets bored and decides to play a game. Fo原创 2017-06-20 23:00:58 · 167 阅读 · 0 评论 -
poj 2159 Ancient Cipher
Ancient Roman empire had a strong government system with various departments, including a secret service department. Important documents were sent between provinces and the capital in encrypted form to原创 2017-06-12 18:06:09 · 196 阅读 · 0 评论 -
hdu 3336 Count the string
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 this string. For example:s: "abab"原创 2017-05-30 20:01:18 · 123 阅读 · 0 评论 -
codeforces 779A
In Berland each high school student is characterized by academic performance — integer value between 1 and 5.In high school 0xFF there are two groups of pupils: the group A and the group B. Each group原创 2017-04-24 23:32:41 · 393 阅读 · 0 评论 -
codeforces 767a
According to an old legeng, a long time ago Ankh-Morpork residents did something wrong to miss Fortune, and she cursed them. She said that at some time n snacks of distinct sizes will fall on the city,原创 2017-04-21 11:54:16 · 326 阅读 · 0 评论 -
codeforces round#478D Ghosts
Open the transmission gate Ghosts live in harmony and peace, they travel the space without any purpose other than scare whoever stands in their way. There are n ghosts in the universe, they m...原创 2018-05-02 17:33:11 · 291 阅读 · 0 评论