
比赛
genuinecai
这个作者很懒,什么都没留下…
展开
-
hdu-6198number number number
Problem Description We define a sequence F:⋅ F0=0,F1=1; ⋅ Fn=Fn−1+Fn−2 (n≥2).Give you an integer k, if a positive number n can be expressed by n=Fa1+Fa2+…+Fak where 0≤a1≤a2≤⋯≤ak, this positive numbe原创 2017-09-12 19:41:11 · 322 阅读 · 0 评论 -
hdu-6197 array array array(最长上升子序列(LIS)长度的O(nlogn)算法)
Problem Description One day, Kaitou Kiddo had stolen a priceless diamond ring. But detective Conan blocked Kiddo’s path to escape from the museum. But Kiddo didn’t want to give it back. So, Kiddo aske原创 2017-09-12 19:57:47 · 205 阅读 · 0 评论 -
hdu 6213-Chinese Zodiac (map)
Problem Description The Chinese Zodiac, known as Sheng Xiao, is based on a twelve-year cycle, each year in the cycle related to an animal sign. These signs are the rat, ox, tiger, rabbit, dragon, snak原创 2017-09-18 17:54:47 · 587 阅读 · 0 评论 -
hdu 6216-A Cubic number and A Cubic Number
Problem Description A cubic number is the result of using a whole number in a multiplication three times. For example, 3×3×3=27 so 27 is a cubic number. The first few cubic numbers are 1,8,27,64 and 1原创 2017-09-18 20:23:40 · 574 阅读 · 1 评论 -
hdu-6195 cable cable cable
Problem Description Connecting the display screen and signal sources which produce different color signals by cables, then the display screen can show the color of the signal source.Notice that every原创 2017-09-12 19:26:48 · 177 阅读 · 0 评论 -
hdu-6214 Smallest Minimum Cut(最小割的最少边)
Problem Description Consider a network G=(V,E) with source s and sink t. An s-t cut is a partition of nodes set V into two parts such that s and t belong to different parts. The cut set is the subset原创 2017-09-21 16:10:07 · 260 阅读 · 0 评论