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

ProblemDescriptionThecounter-terroristsfoundatimebombinthedust.Butthistimetheterroristsimproveonthetimebomb.Thenumbersequenceofthetimebombcountsfrom1toN.Ifthecurrentnumbersequenceincludesthesub-sequence"49",thepoweroftheblastwouldaddonepoint.Nowthecounter-terroristknowsthenumberN.Theywanttoknowthefinalpointsofthepower.Canyouhelpthem? InputThefirstlineofinputconsistsofanintegerT(...
近期评论