摘要:
Color Me LessTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 18730Accepted: 8886DescriptionA color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this problem requires that you perform just such a mapping in a standard twenty-four bit RGB color space. 阅读全文
摘要:
Common SubsequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 17815Accepted: 6847DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another sequence Z = < z1, z2, ..., zk > 阅读全文
摘要:
The TriangleTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 19122Accepted: 11144Description73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. 阅读全文