USACO
文章平均质量分 79
lhyer
这个作者很懒,什么都没留下…
展开
-
USACO 2.1.3 Sorting A Three-Valued Sequence
一.题目描述 Sorting is one of the most frequently performed computational tasks. Consider the special sorting problem in which the records to be sorted have at most three different key values. This happen原创 2015-08-03 16:40:10 · 359 阅读 · 0 评论 -
USACO 2.1.1 The Castle
一.题目描述 In a stroke of luck almost beyond imagination, Farmer John was sent a ticket to the Irish Sweepstakes (really a lottery) for his birthday. This ticket turned out to have only the winning numbe原创 2015-08-02 23:57:21 · 369 阅读 · 0 评论 -
USACO 2.1.2 Ordered Fractions
一.题目描述 Consider the set of all reduced fractions between 0 and 1 inclusive with denominators less than or equal to N. Here is the set when N = 5: 0/1 1/5 1/4 1/3 2/5 1/2 3/5 2/3 3/4 4/5 1/1 W原创 2015-08-03 00:52:35 · 386 阅读 · 0 评论 -
USACO 2.1.4 Healthy Holsteins
一 .题目描述 Farmer John prides himself on having the healthiest dairy cows in the world. He knows the vitamin content for one scoop of each feed type and the minimum daily vitamin requirement for the cow原创 2015-08-03 19:30:32 · 521 阅读 · 0 评论 -
USACO 1.2.5 Hamming Codes
一.题目描述 Given N, B, and D: Find a set of N codewords (1 <= N <= 64), each of length B bits (1 <= B <= 8), such that each of the codewords is at least Hamming distance of D (1 <= D <= 7) away from each原创 2015-08-03 20:23:37 · 355 阅读 · 0 评论 -
USACO 2.2.1 Preface Numbering
一.题目描述 A certain book's prefaces are numbered in upper case Roman numerals. Traditional Roman numeral values use a single letter to represent a certain subset of decimal numbers. Here is the standard原创 2015-08-05 16:14:58 · 276 阅读 · 0 评论 -
USACO 2.2.2 Subset Sums
一.题目描述 For many sets of consecutive integers from 1 through N (1 <= N <= 39), one can partition the set into two sets whose sums are identical. For example, if N=3, one can partition the set {1, 2原创 2015-08-05 21:12:48 · 414 阅读 · 0 评论