Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5738 Accepted: 2508DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total o

Pollutant Control<br />Hal Burch<br />It's your first day in Quality Control at Merry Milk Makers, and already there's been a catastrophe: a shipment of bad milk has been sent out. Unfortunately, you didn't discover this until the milk was already into you

Street Race<br />IOI'95<br />Figure 1 gives an example of a course for a street race. You see some points, labeled from 0 to N (here, N=9), and some arrows connecting them. Point 0 is the start of the race; point N is the finish. The arrows represent one-w

The Perfect Stall<br />Hal Burch<br />Farmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stalls in the new barn are different. For the first week, Farmer J

Drainage Ditches<br />Hal Burch<br />Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow. Thus, Farmer John has built

<br />Camelot<br />IOI 98<br />Centuries ago, King Arthur and the Knights of the Round Table used to meet every year on New Year's Day to celebrate their fellowship. In remembrance of these events, we consider a board game for one player, on which one ches

Cheering Up the CowsTime Limit(Common/Java):1000MS/10000MS     Memory Limit:65536KByteTotal Submit: 10            Accepted: 3 DescriptionFarmer John has grown so lazy that he no longer wants to continue maintaining the cow paths that currently provide a w

Riding the Fences<br /><br />Farmer John owns a large number of fences that must be repaired annually. He traverses the fences by riding a horse along each and every one of them (and nowhere else) and fixing the broken parts. <br />Farmer John is as lazy a

Sweet Butter Greg Galperin -- 2001 <br />Farmer John has discovered the secret to making the sweetest butter in all of Wisconsin: sugar. By placing a sugar cube out in the pastures, he knows the N (1 <= N <= 500) cows will lick it and thus will produce s

Bessie Come Home<br />Kolstad & Burch <br />It's dinner time, and the cows are out in their separate pastures. Farmer John rings the bell so they will start walking to the barn. Your job is to figure out which one cow gets to the barn first (the supplied

Cow ToursFarmer John has a number of pastures on his farm. Cow paths connect some pastures with certain other pastures, forming a field. But, at the present time, you can find at least two pastures that cannot be connected by any sequence of cow paths, thu

National Treasures Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 118   Accepted: 39 Description T