一个管理系统全部

PB制作时钟小程序-PB produced small clock procedures

求解线索二叉树中结点前趋和后继的算法以及以相应次序遍历线索二叉树的算法，二叉树的线索化算法的设计-Solving clues to binary tree node before the trend and follow-up algorithm and the corresponding sequence of binary tree traversal algorithm clues, clues to binary tree algorithm design

双向约瑟夫问题，利用双向链表实现双向进行的约瑟夫问题-Two-way Joseph problems, using two-way two-way linked to the issue of Joseph

一个很好的考勤管理系统-a good Attendance Management System

数据库程序设计，采用java,JDBC,J2EE开发数据库-Database programming, using java, JDBC, J2EE development database

图的建立和图的广度深度优先遍历（有向图和无向图）-Map creation and map the breadth of depth-first traversal (with the map and undirected graph)

均匀分布和高斯分布的C代码-uniform and Gaussian distribution of C code

银行家算法分析报告（ c语言）-bankers algorithm analysis report (c language)

设编号为1，2，···，n的n个人围坐一圈，约定编号为k（1≤k≤n）的人从1开始报数，数到m的那个人出列，他的下一位又从1开始报数，数到m的那个人又出列，依次类推，直到所有人出列为止，由此产生一个出队编号的序列。

问题描述：设有11种不问的钱币各若干张，可用这II种钱币产生许多不同的面值。试 设计一个算法，计算给定的某个面值，能有多少种不同的产生方法。例如有1分3张，2分 3张，5分1张，则能组成7分面值的方法有：3个1分+2个2分，1个1分十3个2分，2 个1分+1个5分，1个2分+1个5分共四种。 ^编程任务：对于给定的II种不同钱币，编程计算某个给定面值能有多少种不同的产生 方法。-Problem Description: There should be 11 kinds of coins did not ask the number of beds available this II produced many different kinds of coin denominations. Try to design an algorithm to calculate a nominal value of a given that there can be many different returned. For instance, a sub-3, 2 points 3, 5 min 1, then can be composed of seven sub-par methods are: 3 1 min+2 2 points, a 1 minute 10 3 2 points, 2 1 points+1 5 points, a 2 min+1 5 minutes of four kinds. ^ Programming task: for a given II different coins, the calculation of a given program can have many different denominations is returned.