coco430的专栏

Meteor Shower Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6218   Accepted: 1836 Description Bessie hears that an extraordinary meteor shower is coming;

Saruman's Army Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 2727   Accepted: 1373 Description Saruman the White must lead his army along a straight pa

Aggressive cows Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4852   Accepted: 2384 Description Farmer John has built a new long barn, with N (2 His

Truck History Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 15445   Accepted: 5933 Description Advanced Cargo Movement, Ltd. uses trucks of different typ

MPI Maelstrom Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 4531   Accepted: 2744 Description BIT has recently taken delivery of their new supercomputer,

Smallest Difference Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 3238   Accepted: 910 Description Given a number of distinct decimal digits, you can for

Cleaning Shifts Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 9242   Accepted: 2461 Description Farmer John is assigning some of his N (1 <= N <= 25,000)

Radar Installation Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 45932   Accepted: 10256 Description Assume the coasting is an infinite straight line. La

Stall Reservations Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 2278   Accepted: 811   Special Judge Description Oh those picky N (1 <= N <= 50,000) c

Fence Repair Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 21562   Accepted: 6886 Description Farmer John wants to repair a small length of the fence aro

Alignment Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 11559   Accepted: 3684 Description In the army, a platoon is composed by n soldiers. During the m

Highways Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 7371   Accepted: 2035   Special Judge Description The island nation of Flatopia is perfectly fla

Common Subsequence Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 34536   Accepted: 13667 Description A subsequence of a given sequence is the given seque

Red and Black Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 19423   Accepted: 10368 Description There is a rectangular room, covered with square tiles. E

Curling 2.0 Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 8930   Accepted: 3762 Description On Planet MM-21, after their Olympic games this year, curling

Six Degrees of Cowvin Bacon Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 2228   Accepted: 1039 Description The cows have been making movies lately, so t

Balanced Lineup Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 29686   Accepted: 14001 Case Time Limit: 2000MS Description For the daily milking, Far

Silver Cow Party Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 10898   Accepted: 4836 Description One cow from each of N farms (1 ≤ N ≤ 1000) convenientl

Monthly Expense Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 11178   Accepted: 4579 Description Farmer John is an astounding accounting wizard and has r

Borg Maze Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7226   Accepted: 2429 Description The Borg is an immensely powerful race of enhanced humanoids fr

Oulipo Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 18241   Accepted: 7323 Description The French author Georges Perec (1936–1982) once wrote a book, La

Description Ignatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会. 魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)的位置,现在知道魔王将在T分钟后回到城堡,Ignatius每分钟能从一个坐标走到相邻的六个坐标中的其中一个

Best Cow Line Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 7377   Accepted: 2322 Description FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annua