_fukua - 博客园

2015年9月14日

摘要： Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Problem DescriptionJack likes to travel around the world, but he doe... 阅读全文

posted @ 2015-09-14 14:28 _fukua 阅读(302) 评论(0) 推荐(0) 编辑

2015年9月13日

hdu 5438 Ponds dfs

摘要： Time Limit: 1500/1000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Problem DescriptionBetty owns a lot of ponds, some of them are connec... 阅读全文

posted @ 2015-09-13 20:59 _fukua 阅读(233) 评论(0) 推荐(0) 编辑

hdu 5437 Alisha’s Party 模拟优先队列

摘要： Problem DescriptionPrincess Alisha invites her friends to come to her birthday party. Each of her friends will bring a gift of some valuev, and all of... 阅读全文

posted @ 2015-09-13 20:11 _fukua 阅读(253) 评论(0) 推荐(0) 编辑

2015年9月11日

CF 500 B. New Year Permutation 并查集

摘要： User ainta has a permutationp1, p2, ..., pn. As the New Year is coming, he wants to make his permutation as pretty as possible.Permutationa1, a2, ...,... 阅读全文

posted @ 2015-09-11 22:00 _fukua 阅读(231) 评论(0) 推荐(0) 编辑

2015年9月10日

CF 500 C. New Year Book Reading 贪心简单题

摘要： New Year is coming, and Jaehyun decided to read many books during 2015, unlike this year. He hasnbooks numbered by integers from 1 ton. The weight of ... 阅读全文

posted @ 2015-09-10 23:29 _fukua 阅读(272) 评论(0) 推荐(0) 编辑

2015年9月9日

codeforces 553A . Kyoya and Colored Balls 组合数学

摘要： Kyoya Ootori has a bag withncolored balls that are colored withkdifferent colors. The colors are labeled from1tok. Balls of the same color are indisti... 阅读全文

posted @ 2015-09-09 23:55 _fukua 阅读(259) 评论(0) 推荐(0) 编辑

逆元学习

摘要：模p乘法逆元：对于整数a,p，若存在整数b，满足ab mod p = 1 ,则说b是a模p的乘法逆元a存在模p乘法逆元的充分必要条件是gcd(a,p)=1证明略。那什么时候我们需要用到逆元呢？比如我们要求a/b%p,我们知道，乘法是可以直接取余，但是除法是不可以直接取余的。这个时候我们要怎么转化呢？... 阅读全文

posted @ 2015-09-09 22:51 _fukua 阅读(205) 评论(0) 推荐(0) 编辑

2015年8月30日

CF 337D Book of Evil 树形DP 好题

摘要： Paladin Manao caught the trail of the ancient Book of Evil in a swampy area. This area containsnsettlements numbered from 1 ton. Moving through the sw... 阅读全文

posted @ 2015-08-30 22:40 _fukua 阅读(241) 评论(0) 推荐(0) 编辑

2015年8月28日

CF 274B Zero Tree 树形DP

摘要： Atreeis a graph withnvertices and exactlyn - 1edges; this graph should meet the following condition: there exists exactly one shortest (by number of e... 阅读全文

posted @ 2015-08-28 23:04 _fukua 阅读(356) 评论(0) 推荐(0) 编辑

CF 461B Appleman and Tree 树形DP

摘要： Appleman has a tree withnvertices. Some of the vertices (at least one) are colored black and other vertices are colored white.Consider a set consistin... 阅读全文

posted @ 2015-08-28 17:46 _fukua 阅读(246) 评论(0) 推荐(0) 编辑