摘要： A -InterpreterTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusAppoint description:DescriptionProblem G: InterpreterA certain computer has 10 registers and 1000 words of RAM. Each register or RAM location holds a 3-digit integer between 0 and 999. Instructions are encoded 阅读全文

摘要： The ? 1 ? 2 ? ... ? n = k problemThe problemGiven the following formula, one can set operators '+' or '-' instead of each '?', in order to obtain a given k? 1 ? 2 ? ... ? n = kFor example: to obtaink = 12, the expression to be used will be:- 1 + 2 + 3 + 4 + 5 + 6 - 7 = 12with 阅读全文

摘要： Tug of WarTime Limit:3000MSMemory Limit:65536KTotal Submissions:8085Accepted:2174DescriptionA tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other; the number of people on the two team 阅读全文

摘要： Problem A: FrecklesIn an episode of the Dick Van Dyke show, little Richie connects the freckles on his Dad's back to form a picture of the Liberty Bell. Alas, one of the freckles turns out to be a scar, so his Ripley's engagement falls through.Consider Dick's back to be a plane with frec 阅读全文