阿丙的博客园

摘要： Two thievesTime Limit:3 SecMemory Limit:128 MBSubmissions:334Solved:62DescriptionThere are two thieves, both of them have a bag whose capacity is CAP (1<= CAP <= 512). And there are N (N <= 128) diamonds, each of them have a weight w and a value v (1 <= w,v <= 512). The consecutive di 阅读全文

摘要： 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 阅读全文

摘要： Gene recombinationDescriptionAs a gene engineer of a gene engineering project, Enigma encountered a puzzle about gene recombination. It is well known that a gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted by four letters, A, C, G, and T.Enigma has gotte 阅读全文