
A.StrangeAddition考虑0的个数,是否存在100,是否同时存在X0和0X[crayon-6925520126bbe616696417/]B.ContinuedFractionshttp://www.cnblogs.com/scau20110726/archive/2013/06/09/3130198.html[crayon-6925520126bc8305880131/]C.IvanandPowersofTwo感觉就是个模拟题0。0,每个数字再往后若干位开始一定就会是连续一段0用map机智的暴力[crayon-6925520126bcc342783327/]D.OlyaandGraph性质1:从i到i+1的边一定要存...

A.DowntheHatch!阅读+模拟题[crayon-692552012720d117243495/]B.MaximumAbsurdity每K个的和求出来以后,就是找距离超过K的两个数相加的最大值[crayon-692552012721a804492677/]C.Students'Revengehttp://m.blog.csdn.net/blog/u010638776/10044315[crayon-6925520127225514520411/]D.TheftofBlueprintswmd神犇:http://blog.csdn.net/wmdcstdio/article/details/44755115[crayon-692552012722e910150526/]E.Binary...

A.HelpfulMaths排序[crayon-69255201278e4141472762/]B.XeniaandRingroad题意即题解[crayon-69255201278f1428624029/]C.XeniaandWeights搜索可过[crayon-69255201278f8155761417/]D.XeniaandBitOperations线段树模拟每次询问可以自底向上修改[crayon-69255201278fc647133193/]E.ThreeSwaps由于只有三次交换,所以数列最多被分成七段找到所有断点爆搜[crayon-6925520127904400746859/] ...

A.VanyaandTable模拟计算面积和[crayon-6925520128de0497665668/]B.VanyaandBooks枚举位数长度计算一下[crayon-6925520128de9652453878/]C.VanyaandScales对于w^k,系数只能取-1,0,1于是不断取模w什么的乱搞一下[crayon-6925520128ded983457939/]D.VanyaandTriangles所有情况减去三点共线按照每个点为基点排序一下扫一遍计算共线[crayon-6925520128df0002880442/]E.VanyaandBrackets发现左括号前面,右括号一定是...

3074.Sudoku数独。。dancinglink经典题[crayon-692552014e28a918211441/]3252.RoundNumbers简单数位dpf(i,j,x,y)表示最高的i位,0比1多j个,是否已小于n,高位是否有1然后转移显然。。。[crayon-692552014e29d873682868/]1665.Biker'sTripOdometer阅读题[crayon-692552014e2a4747740244/]1930.DeadFraction丧心病狂。。枚举循环节[crayon-692552014e2a7538145682/]1970.TheGame[crayon-692552014e2ab223619618/]1185.炮兵...
近期评论