搜索资源列表
2187
- poj2187给一堆点,求出其中的最远点对,凸包的应用-poj2187 to a pile of points, obtained one of the furthest points right, the application of convex hull
3352
- poj3352给一个图,求出需要加最少的边使去掉任一条边,图都连通.割点的应用-poj3352 to a map, obtained at least the need to remove the edges so that any one side, map are connected. cut-point application
Minus
- 大整数减法 poj 2981 用字符串实现大整正数的减法-poj 2981
Multiply
- 大整数乘法 poj 2980 比一般的算法快一点点哦-Poj 2980 large integer multiplication
Plus
- 大整数加法 poj 2981 这是真的加法，我还传了一个减法，名字写成加法了，不知怎么改，郁闷-Large integer Adder poj 2981
Poj1022
- 本题写了一个EE3的产品描述，是四维的。确实很难想像清楚。我们这样想就行。它有四个坐标，每一维都可以放上一个立方体，边长为1.然后就是怎么判断是否Inconsistent，有两种情况：1），如题上举的例子，ID为1的在x2坐标上前面是3，那么ID为3的在X2坐标的后面应该是1，否则就Inconsistent。-We usually think that there are three geometric dimensions the fourth dimension is usually ti
Poj_1011_sticks
- 由题意知道，本题就是根据题目给出的木棒，拼出长度最短的等长的棒子，本题主要应用了深度优先搜索+强剪枝。我们知道，肯定是先把小棒排序，从最大的开始枚举，然后如果到某一个长度时，满足条件，哪么就输出该长度。-George took sticks of the same length and cut them randomly until all parts became at most 50 units long. Now he wants to return sticks to the origi
3058
- 北大ACM试题poj 第3058题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3058 question Question poj source code, good code, and want to help students engage in ACM
3065
- 北大ACM试题poj 第3065题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3065 question Question poj source code, good code, and want to help students engage in ACM
3061
- 北大ACM试题poj 第3061题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3061 question Question poj source code, good code, and want to help students engage in ACM
3072
- 北大ACM试题poj 第3072题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3072 question Question poj source code, good code, and want to help students engage in ACM
3068
- 北大ACM试题poj 第3068题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3068 question Question poj source code, good code, and want to help students engage in ACM
Desktop
- 北大ACM试题poj 第3066 3069题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 30,663,069 question Question poj source code, good code, and want to help students engage in ACM
ACMPOJ
- ACM POJ题目 2159.cpp 1918.cpp 1887.cpp 1835.cpp 1458.c 1258.c 1125.c-ACM POJ 2159.cpp 1918.cpp 1887.cpp 1835.cpp 1458.c 1258.c 1125.cpp
acm_code_ComputingGeometry
- acm计算几何模板，涵盖了包括hdu,pku,zju,fzu等评测平台的逾90个通过的计算几何代码。 适合想要学习计算几何的acmer.-acm computational geometry templates, covering hdu, pku, zju, fzu such as evaluation platforms, more than 90 adopted by the computational geometry code. Want to learn computatio
1228
- POJ 1228 求解凸包， 并判断凸包每条边上点的数量-Tu Bao
poj-4044-jinhua_A
- 2012金华邀请赛源码http://poj.org/problem?id=40-2012 Jinhua Invitational source http://poj.org/problem?id=4044
poj-4045-jinhua_B
- 2012金华邀请赛B题源码http://poj.org/problem?id=4045-2012 the Jinhua Tournament Problem B source http://poj.org/problem?id=4045
poj-4047-jinhua_D
- 2012金华邀请赛源码http://poj.org/problem?id=4046-2012 Jinhua Invitational source http://poj.org/problem?id=4046
poj-4049-jinhua_F
- 2012金华邀请赛F题源码http://poj.org/problem?id=4049-2012 Jinhua Invitational F title source http://poj.org/problem?id=4049