3074.Sudoku数独。。dancinglink经典题[crayon-68c2544b34204153718953/]3252.RoundNumbers简单数位dpf(i,j,x,y)表示最高的i位,0比1多j个,是否已小于n,高位是否有1然后转移显然。。。[crayon-68c2544b34219992501655/]1665.Biker'sTripOdometer阅读题[crayon-68c2544b3421f143796546/]1930.DeadFraction丧心病狂。。枚举循环节[crayon-68c2544b34223081532260/]1970.TheGame[crayon-68c2544b34229203228179/]1185.炮兵...
ProblemDescriptionThecounter-terroristsfoundatimebombinthedust.Butthistimetheterroristsimproveonthetimebomb.Thenumbersequenceofthetimebombcountsfrom1toN.Ifthecurrentnumbersequenceincludesthesub-sequence"49",thepoweroftheblastwouldaddonepoint.Nowthecounter-terroristknowsthenumberN.Theywanttoknowthefinalpointsofthepower.Canyouhelpthem? InputThefirstlineofinputconsistsofanintegerT(...
近期评论