登录
首页 » Visual C++ » 1013_digital_root

1013_digital_root

于 2012-04-27 发布 文件大小:91KB
0 223
下载积分: 1 下载次数: 3

代码说明:

  数字根算法,用最简单的代码计算数字根。如果把一个大数的各位数字相加得到一个和,再把这个和的各位数字相加又得一个和,再继续作数字和,直到最后的数字和是个位数为止,这最后的数称为最初那个数的“数字根”。(Digital root algorithm, with the most simple code to calculate the digital root. If you figure in a large numbers is the sum of a, then this and you figure the sum is again a, and then continue for digital and until the final figure and the single digits, the last number called initially that the number of "digital root".)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • huffman_tree
    数据结构学习中提供的不错的源码,一个哈夫曼树类,利用了链队列存储结构。压缩包中有七个文件。(Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.)
    2013-12-28 15:21:48下载
    积分:1
  • Prim
    编程实现Prim算法,基于最小堆数据结构,生成最小代价生成树。 (其中随机生成点和边,形成连通图) 根据输入的顶点数的不同,分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for given size n according to the following approach: 1) Randomly generate n points ( ) on a plane 2) Randomly generate k pairs of points as edges of the graph. 3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge. )
    2011-06-11 16:28:53下载
    积分:1
  • GraphTheory
    讲述数据机构的图论部分和程序设计的关系,适合学习算法的同学学习阅读,很不错的一本书。(Graph theory algorithm and programming)
    2013-12-04 20:12:39下载
    积分:1
  • 8queen
    此程序用于解决8皇后问题,运行后输出8皇后问题的所有解(This program is used to solve the 8 queens problem, all solutions of 8 queens problem output operation.)
    2013-05-06 21:15:23下载
    积分:1
  • Online_RandMarkingAlgorithm
    本程序解决的是:模拟类似计算机主、缓存的存储结构,当用户请求某个页面时,若某个页面已在缓存中,则直接从缓存中去取,不会产生失误(即未在缓存中命中),否则,就到主存中去取,代价变大。 本程序采用随机标记算法,即在在线标记算法的基础上,对于替换页面时,采用随机从未标记的缓存项中选出一项进行替换。 代码、文档详尽(Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed)
    2012-09-19 13:01:47下载
    积分:1
  • shujujiegoukechengshiji
    数据结构课程设计时,所需的封面及任务书版面,希望对大家有点用!(Curriculum design data structure, the necessary task of the book cover and layout, in the hope that we are a bit used!)
    2008-06-16 18:38:51下载
    积分:1
  • Dijkstra
    迪杰斯特拉算法,数据结构,C语言写的,上大学计算机系会用到的。。。(Dijkstra algorithm, data structures, C language written on the Department of Computer Science will be used. . .)
    2013-03-06 21:50:34下载
    积分:1
  • radixsort
    对首先产生20个随机数进行基数排序,是利用C++实现的(On the first 20 random numbers generated for the base sequencing is the use of C++ Realize the)
    2007-10-16 19:11:53下载
    积分:1
  • b
    说明:  定义一个类SortArray继承自MyArray,在该类中定义函数sort实现排序功能。 定义一个类ReArray继承自MyArray,在该类中定义函数reverse实现逆转功能。 定义一个类AverArray继承自MyArray,在该类中定义函数Aver实现求解整数的平均值。 定义NewArray类,同时继承了SortArray、ReArray和AverArray,使得NewArray类的对象同时具有排序、逆转和求平均值的功能。在继承的过程中声明为虚基类,体会虚基类在解决二义性问题中的作用。 (Define a class SortArray inherited from MyArray, defined in the class sorting function sort implementation. Define a class ReArray inherited from MyArray, define the function in reverse to achieve such reversal function. Define a class AverArray inherited from MyArray, defined in the class to solve integer function Aver achieve the average. Defined NewArray class, and inherits SortArray, ReArray and AverArray, making the object of both NewArray class sorting, reversing, and the mean value of the function. In the process of succession declared as virtual base classes, virtual base class experience in resolving ambiguities of the role.)
    2010-06-02 02:13:03下载
    积分:1
  • 005
    c++ data struct stack
    2012-03-01 14:24:42下载
    积分:1
  • 696518资源总数
  • 106161会员总数
  • 5今日下载