BestCoder
efine_dxq
这个作者很懒,什么都没留下…
展开
-
HDU5601:N*M bulbs
官方题解:N*M bulbs我们发现操作数跟n+m−1n+m-1n+m−1同奇偶,那是不是当111的个数跟n+m−1n+m-1n+m−1同奇偶是就是YES呢?答案是肯定的,我们这样看:首先将棋盘黑白染色,就是若(i,j)(i,j)(i,j)格子,若(i+j)(i+j)(i+j)是奇数,那么就是黑格子,否则就是白格子。我们发现我们可以通过一种操作使得从一个格子走到斜方向的原创 2015-12-28 21:50:06 · 556 阅读 · 0 评论 -
HDU5600:N bulbs
官方题解:N bulbs我们注意到总的操作次数是跟 nn 奇偶的。这个很重要,也就是如果11的数量和 n n不同奇偶,那么一定无解。那么现在问题是 11 和 nn 同奇偶的情况下,是不是一定有解?答案是显然的。因为 11 和n n同奇偶,所以 00的个数是偶数,我们发现当我们从 11 走到iii时,假设我们往回走到左边某个点kk,原创 2015-12-29 08:32:11 · 585 阅读 · 2 评论 -
HDU5595:GTW likes math
GTW likes mathTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 673 Accepted Submission(s): 327Problem DescriptionAfter attending原创 2015-12-29 17:25:03 · 476 阅读 · 0 评论 -
HDU 5610: Baby Ming and Weight lifting
Baby Ming and Weight liftingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 136 Accepted Submission(s): 57Problem DescriptionBaby原创 2016-01-23 22:37:45 · 728 阅读 · 0 评论 -
HDU 5611: Baby Ming and phone number
Problem DescriptionBaby Ming collected lots of cell phone numbers, and he wants to sell them for money.He thinks normal number can be sold for b yuan, while number with following features can原创 2016-01-23 22:50:42 · 592 阅读 · 0 评论 -
HDU5615:Jam's math problem
Problem DescriptionJam has a math problem. He just learned factorization.He is trying to factorize ax2+bx+c into the form of pqx2+(qk+mp)x+km=(px+k)(qx+m).He could only solve the problem in wh原创 2016-01-31 16:23:13 · 603 阅读 · 0 评论