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