hdu
文章平均质量分 66
Smile__wei
这个作者很懒,什么都没留下…
展开
-
hdu6043--KazaQ's Socks
Problem Description KazaQ wears socks everyday. At the beginning, he has n pairs of socks numbered from 1 to n in his closets. Every morning, he puts on a pair of socks which has the sma原创 2017-07-26 11:02:40 · 446 阅读 · 0 评论 -
hdu6081--度度熊的王国战略(百度之星资格赛)
Problem Description 度度熊国王率领着喵哈哈族的勇士,准备进攻哗啦啦族。 哗啦啦族是一个强悍的民族,里面有充满智慧的谋士,拥有无穷力量的战士。 所以这一场战争,将会十分艰难。 为了更好的进攻哗啦啦族,度度熊决定首先应该从内部瓦解哗啦啦族。 第一步就是应该使得哗啦啦族内部不能同心齐力,需要内部有间隙。 哗啦啦族一共有n个将领,他们一共有m个强关系,摧原创 2017-08-17 19:10:55 · 436 阅读 · 0 评论 -
hdu6033--Add More Zero
Problem Description There is a youngster known for amateur propositions concerning several mathematical hard problems. Nowadays, he is preparing a thought-provoking problem on a specific type of s原创 2017-07-26 11:46:54 · 316 阅读 · 0 评论 -
hdu6055--Regular polygon
Problem Description On a two-dimensional plane, give you n integer points. Your task is to figure out how many different regular polygon these points can make. Input The input file consists of seve原创 2017-07-28 11:04:00 · 372 阅读 · 0 评论 -
hdu6047--Maximum Sequence
Problem Description Steph is extremely obsessed with “sequence problems” that are usually seen on magazines: Given the sequence 11, 23, 30, 35, what is the next number? Steph always finds them too ea原创 2017-07-28 21:40:06 · 654 阅读 · 2 评论 -
hdu6034--Balala Power!
Problem Description Talented Mr.Tang has n strings consisting of only lower case characters. He wants to charge them with Balala Power (he could change each character ranged from a to z in原创 2017-07-27 20:30:44 · 493 阅读 · 0 评论 -
hdu6130--Kolakoski
Problem Description This is Kolakosiki sequence: 1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,1,2,2,1……. This sequence consists of 1 and 2, and its first term equals 1. Besides, if you see adjacent and e原创 2017-08-15 14:00:00 · 365 阅读 · 0 评论