# /yjdata/www/wordpress

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

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