摘要：
SunscreenTime Limit:1000MSMemory Limit:65536KTotal Submissions:2616Accepted:925DescriptionTo avoid unsightly burns while tanning, each of theC(1 ≤C≤ 2500) cows must cover her hide with sunscreen when they're at the beach. Cowihas a minimum and maximumSPFrating (1 ≤minSPFi≤ 1,000;minSPFi≤maxSPFi≤ 阅读全文
摘要：
Aizu 2170: http://www.cnblogs.com/lzj-0218/p/3273342.html 阅读全文
摘要：
Marked AncestorTime Limit : 8 sec, Memory Limit : 65536 KBProblem F:Marked AncestorYou are given a treeTthat consists ofNnodes. Each node is numbered from 1 toN, and node 1 is always the root node ofT. Consider the following two operations onT:M v: (Mark) Mark nodev.Q v: (Query) Print the index of t 阅读全文
摘要：
Milking TimeTime Limit:1000MSMemory Limit:65536KTotal Submissions:3607Accepted:1533DescriptionBessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her nextN(1 ≤N≤ 1,000,000) hours (conveniently labeled 0..N-1) so that she produces 阅读全文
摘要：
Apple CatchingTime Limit:1000MSMemory Limit:65536KTotal Submissions:6397Accepted:3102DescriptionIt is a little known fact that cows love apples. Farmer John has two apple trees (which are conveniently numbered 1 and 2) in his field, each full of apples. Bessie cannot reach the apples when they are o 阅读全文
摘要：
SumsetsTime Limit:2000MSMemory Limit:200000KTotal Submissions:11009Accepted:4433DescriptionFarmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer power of 2. Here are the possible sets of numbers that sum to 7: 阅读全文