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