摘要： Gao the GridTime Limit: 2 Seconds Memory Limit: 65536 KBA n * m grid as follow:Count the number of triangles, three of whose vertice must be grid-points.Note that the three vertice of the triangle must not be in a line(the right picture is not a triangle). InputThe input consists of several cases... 阅读全文

摘要： Kitty's GameTime Limit: 2 Seconds Memory Limit: 65536 KBKitty is a little cat. She is crazy about a game recently.There are n scenes in the game(mark from 1 to n). Each scene has a number pi. Kitty's score will become least_common_multiple(x,pi) when Kitty enter the ith scene. x is the score 阅读全文

摘要： PipesTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 301Accepted Submission(s): 154Problem DescriptionThe construction of office buildings has become a very standardized task. Pre-fabricated modules are combined according to the customer’s needs, s 阅读全文

摘要： Manhattan WiringTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 1112Accepted: 636DescriptionThere is a rectangular area containing n × m cells. Two cells are marked with “2”, and another two with “3”. Some cells are occupied by obstacles. You should connect the two “2”s and also the tw 阅读全文

摘要： Tony's TourTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 2648Accepted: 1197DescriptionA square township has been divided up into n*m(n rows and m columns) square plots (1<=N,M<=8),some of them are blocked, others are unblocked. The Farm is located in the lower left plot and the 阅读全文