YC_WORLD

摘要： Problem DescriptionThere arenapple trees planted along a cyclic road, which isLmetres long. Your storehouse is built at position0on that cyclic road.T... 阅读全文

摘要： DescriptionYour current task is to make a ground plan for a residential building located in HZXJHS. So you must determine a way to split the floor bui... 阅读全文

摘要： 总算今天静下心来学算法。。DescriptionInnocent Wu follows Dumb Zhang into a ancient tomb. Innocent Wu’s at the entrance of the tomb while Dumb Zhang’s at the end of... 阅读全文

摘要： DescriptionTom owns a company and he is the boss. There are n staffs which are numbered from 1 to n in this company, and every staff has a ability. No... 阅读全文

摘要： DescriptionOO has got a array A of size n ,defined a function f(l,r) represent the number of i (li) satisfy aimod aj=0,now OO want to know [∑i=1n ∑j=i... 阅读全文

摘要： 题意是：给出n个点，围成m个区域。从区域到另一个区域间需穿过至少一条边（若两区域相邻）——边连接着两点。给出这么一幅图，并给出一些点，问从这些点到同一个区域的穿过边数最小值。解题思路如下：将区域按1~m编号，d[i][j]表示第 i 个区域到第 j 个区域的最短距离，跑一遍Floye算法O(m^3)... 阅读全文