思维题
文章平均质量分 85
h1021456873
这个作者很懒,什么都没留下…
展开
-
codeforce 796 c Bank Hacking (思维题,分类讨论)
Although Inzane successfully found his beloved bone, Zane, his owner, has yet to return. To search for Zane, he would need a lot of money, of which he sadly has none. To deal with the problem, he has原创 2017-04-15 11:03:31 · 705 阅读 · 0 评论 -
Codeforces 796D Police Stations (bfs+思维)
Inzane finally found Zane with a lot of money to spare, so they together decided to establish a country of their own. Ruling a country is not an easy job. Thieves and terrorists are always ready to原创 2017-04-15 17:52:15 · 608 阅读 · 0 评论 -
Codeforces 789E The Great Mixing (数推倒公式 + bfs + 剪枝)
题意:有k个数,是1/1000的倍数,问能否选取任意个数,每个数也能选任意次,使他们的均值为n/1000 题解:假设选了m个数 (s1+s2+...sm)/1000/m=n/1000,化简后得到(s1-n)+(s2-n)+....+(sm-n)=0,原题转化成从k个数中选m个数使他们的和为0,且选出来的数的和的范围必然是在[-1000,1000],这样用bfs来写,就可以得到最少需要选几个数原创 2017-04-16 13:30:14 · 570 阅读 · 0 评论 -
codeforces 792 C. 删除尽量少的位数后是3的倍数 (取余问题+分类讨论+模拟吧)
题意:给出一个正整数n,问用最少的删除操作是它变成美丽数。 美丽数的定义:没有前导0,且是3的倍数。输出任意美丽数,无解输出-1。 题解:是三的倍数,和也是三的倍数。求和mod3之后,有三种情况, 1:和为0,即本身就是美丽数,直接输出。 2:和为1,此时应该删除一个1(mod3为1,下同)或者两个2。 3:和为2,此时应该删除一个2或者两个1。原创 2017-04-16 17:11:59 · 715 阅读 · 0 评论