poops

约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1，最后结果+1即为原问题的解。 (Josephus (Josephus problem) is the application of a mathematical problem: Given n individuals (with numbers 1,2,3 ... n respectively) sitting around a round table. From the number of people gettin k, number of the m man out of the line he s the next person and a number of gettin number to m the man was out of the line and so the law is repeated until the round table were all out of the column. We numbered 0 ~ n-1, the final result is the original problem solution+1 usually solve these problems.)

用动态规划法求两个字符串 A="xzyzzyx"和 B =”zxyyzxz“的最长公共子序列(For two strings A dynamic programming method = " xzyzzyx" and B = " zxyyzxz" the longest common subsequence)

在一个N*N的棋盘上指点任意一点的坐标，以马走日的方式走完整个棋盘且没有重复，试分别用DFS、BFS方法求解并输出全部可能的路径。(knight tour problem solved by the method of BFS and DFS.)

这是birch C语言的源代码。里面有详细的代码注释方便学习birch算法(birch c)

在本文章里面，有各种举出算法的C语言实现 1、大数阶乘 2、大数乘法 3、任意进制转换 4、最大公约数 5、最小公倍数 6、快速傅里叶变换 7，字符串的替换，查找，截取 8、叉乘法求多边形的面积 9、快速，希尔，选择等各种排序 10、二叉树，链表，链栈 11、二分查找 12、求解线性方程组，也叫中国余数定理 13、求点到直线距离 14、Prim算法求最小生成器 15、判断点与直线的关系，俩条直线的关系 16、求排列组合数，俩矢量角度 ...... 等等基础算法的C语言代码实现(1, large factorial 2, a large number of multiplication 3, arbitrary binary conversion 4, the largest common divisor 5, the least common multiple 6, fast Fourier transform 7, string replacement, search, interception 8, fork multiplication method for polygon area 9, fast, Hill, choice and other sort 10, binary tree, linked list, chain stack 11, binary search 12, solving linear equations, also known as the Chinese remainder theorem 13, seeking point to a straight line distance 14, Prim algorithm for the minimum generator 15, determine the point and the relationship between the two lines of the relationship 16, the number of permutations and combinations, two vector angle ... And so on the basis of the C language code algorithm)

浙大题库数据结构学习与项目指导 实验项目集 4-05. 家谱处理(Zhejiang University Exam 4-05. Genealogy processing)

二叉树的C++实现，成员可以自己调整，实现了各种修剪此树的方法：初始化，增加节点，删去节点，复制树，读取节点，遍历树(Binary tree in C++, members can make their own adjustments to achieve a variety of pruning this tree methods: initialize, add nodes, delete nodes, copy the tree, read the node, traverse the tree)

说明：  数据结构算法实现C++ Builder上机验证实现(Data structure algorithms to achieve local authentication on C++ Builder)

银行排队叫号演示 课程设计报告 看看你能不能用能(Bank queuing demonstrate curriculum design to see if you can not use)

假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)