The use of C language procedures for the three

应用背景方法一：伪代码输入：n只鸡的个数 输出：公鸡、母鸡和小鸡的个数1、初始化解的个数count=0； 2、循坏变量从x从0~n/5（取整）;    2.1循环变量y从0~n/3(取整)；       2.1.1 循环变量z从0~n；       2.1.2 如果5*x+3*y+z/3==n && x+y+z==n，则count++；输出x、y、z的值；       2.1.3  y++；

IFSVIEWER CODE in c++， VS2008环境开发 c++研究生课程作业 computer graphic开发

c/c++ 二叉树遍历先序中序 后序层次遍历算法 包括递归和对应的非递归算法，建立二叉搜索树，层次输出二叉搜索树。

实现多项式的因是分解-polynomial is the result of decomposition

这是蚁群算法的代码。它只是表明，该算法没有别的。  有益借鉴前瞻性。

倒酒问题描述： 设有两个能装8两的酒杯（称为１号，２号）装满了酒, 和1个能装3两的空酒杯（称为３号）, 问怎样用这3个酒杯向4个人 敬酒, 使得每个人都喝4两酒. 要求： 用程序计算出可行方案。 输入： 无 输出： 每一步决策．-down quite Problem description : two can be loaded with two of the eight glasses (known as 1, 2) filled with the wine, and one can hold three two empty glasses (known as the 3rd) and asked how to use it three to four glasses and toast the individual, so that each person maximum servings of both types 4 2 liquor. Request : procedures calculated options. Input : None output : each step of the decision-making.

堆排序例子-Example of heap sorting

GMP是计算任意精度的数学库, 包括支持整数,有理数和浮点. GMP包括大量的接口函数.-GMP is a free library for arbitrary precision arithmetic, operating on signed integers, rational numbers, and floating point numbers. There is no practical limit to the precision except the ones implied by the available memory in the machine GMP runs on. GMP has a rich set of functions, and the functions have a regular interface.

几个小排序- Several slightly arrange

GM(1,1)模型GM(1,n) 灰色度模型 但回归-GM(1,1)