随笔分类 - HDU
摘要：Function Problem Description The shorter, the simpler. With this problem, you should be convinced of this truth. You are given an array A of N postive
阅读全文
摘要：Different GCD Subarray Query Problem Description This is a simple problem. The teacher gives Bob a list of problems about GCD (Greatest Common Divisor
阅读全文
摘要：Weak Pair Problem Description You are given a rooted tree of N nodes, labeled from 1 to N. To the ith node a non-negative value ai is assigned.An orde
阅读全文
摘要：The Famous ICPC Team Again Problem Description When Mr. B, Mr. G and Mr. M were preparing for the 2012 ACM-ICPC World Final Contest, Mr. B had collect
阅读全文
摘要：D Tree Problem Description There is a skyscraping tree standing on the playground of Nanjing University of Science and Technology. On each branch of t
阅读全文
摘要：K-wolf Number Problem Description Alice thinks an integer x is a K-wolf number, if every K adjacent digits in decimal representation of x is pairwised
阅读全文
摘要：Two Problem Description Alice gets two sequences A and B. A easy problem comes. How many pair of sequence A' and sequence B' are same. For example, {1
阅读全文
摘要：Lucky Problem Description WLD is always very lucky.His secret is a lucky number K.k is a fixed odd number. Now he meets a stranger with N numbers:a1,a
阅读全文
摘要：NPY and girls Problem Description NPY's girlfriend blew him out!His honey doesn't love him any more!However, he has so many girlfriend candidates.Beca
阅读全文
摘要：Information Disturbing Problem Description In the battlefield , an effective way to defeat enemies is to break their communication system.The informat
阅读全文
摘要：The more, The Better Problem Description ACboy很喜欢玩一种战略游戏，在一个地图上，有N座城堡，每座城堡都有一定的宝物，在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因，有些城堡不能直接攻克，要攻克这些城堡必须先攻克其他某一个特定
阅读全文
摘要：Tunnel Warfare Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description During the War of Resistance Again
阅读全文
摘要：Covered Walkway Problem Description Your university wants to build a new walkway, and they want at least part of it to be covered. There are certain p
阅读全文
摘要：Warm up Problem Description N planets are connected by M bidirectional channels that allow instant transportation. It's always possible to travel betw
阅读全文
摘要：Paint Pearls Problem Description Lee has a string of n pearls. In the beginning, all the pearls have no color. He plans to color the pearls to make it
阅读全文
摘要：吉哥系列故事——完美队形II Problem Description 吉哥又想出了一个新的完美队形游戏！ 假设有n个人按顺序站在他的面前，他们的身高分别是h[1], h[2] ... h[n]，吉哥希望从中挑出一些人，让这些人形成一个新的队形，新的队形若满足以下三点要求，则就是新的完美队形： 1、挑
阅读全文
摘要：Dire Wolf Problem Description Dire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, Dire Wolves app
阅读全文
摘要：XOR 游戏 Problem Description 众所周知，度度熊喜欢XOR运算[（XOR百科）](http://baike.baidu.com/view/674171.htm)。今天，它发明了一种XOR新游戏，最开始，它有一个长度为N的数组，度度熊可以任意添加分割线，将数组划分为M段，且每段长
阅读全文
摘要：One hundred layer Problem Description Now there is a game called the new man down 100th floor. The rules of this game is: 1. At first you are at the 1
阅读全文
摘要：Dragon Ball Problem Description Sean has got a Treasure map which shows when and where the dragon balls will appear. some dragon balls will appear in
阅读全文
浙公网安备 33010602011771号