poj 1042 Gone Fishing 枚举加贪心思想,也可用动态规划做-poj 1042 Gone Fishing enumeration plus greedy thinking, dynamic programming can also be used to do

求和由于最后一扇门肯定在正方形的边界举，对每一个中点都求出要从给定点P到达此中点的所需要的最少的门的个数。-hello word wellcom to our school Delphi/java,CppBuilder visual c++Gone Fishing (1042) - ACM/ICPC Regional Contest East Central North America1999Descr iption Archeologists from the Ant