涅槃phy的专栏

Description Every time itrains on Farmer John's fields, a pond forms over Bessie's favorite cloverpatch. This means that the clover is covered by water for awhile and takesquite a long time to regrow

Description FJ has moved his K(1 <= K <= 30) milking machines out into the cow pastures among the C (1<= C <= 200) cows. A set of paths of various lengths runs among the cowsand the milking machines.

ProblemDescription There are Ncandies and M kids, the teacher will give this N candies to the M kids. Thei-th kids for the j-th candy has a preference for like[i][j], if he like thesugar, like[i][j]

Breaking news! A Russian billionaire has bought a yet undisclosed NBA team. He's planning to invest huge effort and money into making that team the best. And in fact he's been very specific about the

Description Mirko works on apig farm that consists of M locked pig-houses and Mirko can't unlock anypighouse because he doesn't have the keys. Customers come to the farm one afteranother. Each of the

Description When FJ's friendsvisit him on the farm, he likes to show them around. His farm comprises N (1<= N <= 1000) fields numbered 1..N, the first of which contains his houseand the Nth of which

ProblemDescription   A newcandy factory opens in pku-town. The factory import M machines to produce highquality candies. These machines are numbered from 1 to M.   There are N candies need to be pro

Problem Description There are (N+1) cities on TAT island. City 0 is where police headquarter located. The economy of other cities numbered from 1 to N ruined these years because they are all controll

题目3 : 格格取数 时间限制:2000ms 单点时限:1000ms 内存限制:256MB 描述 给你一个m x n (1 的矩阵A (0ij，要求在矩阵中选择一些数，要求每一行，每一列都至少选到了一个数，使得选出的数的和尽量的小。   输入 多组测试数据。首先是数据组数T 对于每组测试数据，第1行是两个正整数m, n，分别表示矩阵的行数和列数。 接下来的m行，每行n