- 博客(7)
- 资源 (2)
- 收藏
- 关注
原创 poj 2299 Ultra-QuickSort
Description In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the seque
2017-05-03 17:12:22 309
原创 poj 2337 Catenyms
Description A catenym is a pair of words separated by a period such that the last letter of the first word is the same as the last letter of the second. For example, the following are catenyms: d
2017-05-03 11:41:01 285
原创 poj 1386 Play on Words
Description Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzz
2017-05-03 09:49:04 327
原创 常用小方法整理3
错排公式 n各有序的元素应有n!种不同的排列。如若一个排列式的所有的元素都不在原来的位置上,则称这个排列为错排。 核心递推公式: D(n) = (n-1) [D(n-2) + D(n-1)] 特殊地,D(1) = 0, D(2) = 1. 欧拉回路的判定 一.无向图 一个无向图存在欧拉路径,当且仅当 该图所有顶点的度数为偶数 或者 除了两个度数为奇数外其余的全是偶数。
2017-05-03 09:47:28 314
原创 poj 2230 Watchcow
Description Bessie's been appointed the new watch-cow for the farm. Every night, it's her job to walk across the farm and make sure that no evildoers are doing any evil. She begins at the barn, mak
2017-05-03 09:25:47 251
转载 高精度模板 大数的基本运算
#include #include #include #include #include #include using namespace std; const int MAXN = 410; //数字的最大长度,根据情况自己调整 struct bign { int len, s[MAXN]; bign () { memset(s, 0, sizeof(s));
2017-05-02 15:59:30 238
原创 蓝桥杯 分巧克力
儿童节那天有K位小朋友到小明家做客。小明拿出了珍藏的巧克力招待小朋友们。 小明一共有N块巧克力,其中第i块是Hi x Wi的方格组成的长方形。 为了公平起见,小明需要从这 N 块巧克力中切出K块巧克力分给小朋友们。切出的巧克力需要满足: 1. 形状是正方形,边长是整数 2. 大小相同 例如一块6x5的巧克力可以切出6块2x2的巧克力或者2块3x3的巧克力。 当然小朋
2017-05-02 15:06:05 407
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人