2012年8月30日
USACO Section 2.1 Hamming Codes （dfs）
摘要： Hamming CodesRob KolstadGiven 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 of the other codewords. The Hamming distance between a pair of co 阅读全文
posted @ 2012-08-30 18:46 mtry 阅读(492) 评论(0) 推荐(0)
USACO Section 2.1 Healthy Holsteins（状态压缩）
摘要： Healthy HolsteinsBurch & KolstadFarmer 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 cows. Help Farmer John feed his cows so they stay healthy while minimizing t 阅读全文
posted @ 2012-08-30 15:59 mtry 阅读(376) 评论(0) 推荐(0)
USACO Section 2.1 The Castle （dfs）
摘要： The CastleIOI'94 - Day 1In 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 number for the lottery! Farmer John won a fabulous castle in the Irish countryside.Br 阅读全文
posted @ 2012-08-30 13:54 mtry 阅读(270) 评论(0) 推荐(0)