摘要： Scrambled PolygonTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 4849Accepted: 2293DescriptionA closed polygon is a figure bounded by a finite number of line segments. The intersections of the bounding line segments are called the vertices of the polygon. When one starts at any vertex of a 阅读全文

摘要： Space AntTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 1799Accepted: 1147DescriptionThe most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y1999 and called it M11. It has only one eye on the left side o 阅读全文

摘要： 移动 IITime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 27(14 users)Total Accepted: 16(14 users)Special Judge: NoDescription在坐标轴[0,500]上存在两点A,B。点A可以多次移动，每次移动需要遵循如下规则：1.向后移动一步。2.向前移动一步。3.跳到当前坐标*2的位置上。要求：利用宽搜算法编程求解从A移动到B的步数最少的方案，为使答案统一，要求搜索按照规则1、2、3的顺序进行。Input输入包含多组测试用例。每组测试用例要求输入两个整数A,B。Output按要求输 阅读全文