随笔分类 - OJ_HUST
摘要:Next K-Bit NumberTime Limit:1 SecMemory Limit:128 MBSubmissions:368Solved:138Description Our problem is to create a function:uintNextKBitNumber(uint), which given an unsigned integer X with K bits set, returns the immediately larger unsigned integer also with K bits set. For example, if X = 12 (bas.
阅读全文
摘要:Reverse NumberTime Limit:1 SecMemory Limit:128 MBSubmissions:357Solved:66DescriptionGiven a non-negative integer sequence A with length N, you can exchange two adjacent numbers each time. After K exchanging operations, what’s the minimum reverse number the sequence can achieve?The reverse number of
阅读全文
摘要:MultipleTime Limit:2 SecMemory Limit:64 MBSubmissions:197Solved:35DescriptionRocket323loves math very much. One day,Rocket323got a number string. He could choose some consecutive digits from the string to form a number.Rocket323loves 64 very much, so he wanted to know how many ways can he choose fro
阅读全文
摘要:The mell hellTime Limit:1000MSMemory Limit:131072KB64bit IO Format:%lld & %lluDescriptionInHUST,there are always many students go to themellhall at the same time as soon as the bell rings. Students have to queue up for a meal ,and the queue isawalyslong,So it takes much time.Suposse there are N
阅读全文
摘要:Little Sheep and a paperTime Limit:2 SecMemory Limit:128 MBSubmissions:95Solved:30Description One day, god Sheep gets an AK(all kill) in a contest, so he is very boring, then he just plays with a paper. The paper has two faces called A and B. Sheep finds the paper can be folded for infinity times,..
阅读全文