George decide prepare Codesecrof round prepared m problem round Lets number problem integer 1 m George estimate ith problem complexity integer biTo round good need n problem besides need problem complexity exactly a1 complexity exactly a2 complexity exactly of course round problem complexitiesgeorge poor imagination its easy prepared problem simple come new prepare George magnificent simplify problem he simplify prepared problem complexity c positive integer complexity d cd change limit input dataHowever simple George understand simplifie problem run problem good round that s decide find minimum number problem need come addition m he s prepared order good round Note George come new problem complexity