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

1013_digital_root

于 2012-04-27 发布 文件大小:91KB
0 274
下载积分: 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 个回复

  • Work3.5
    上海交通大学数据结构课程的课后作业系列3.5:仅供参考,最好还是自己去写(Shanghai Jiaotong University data structure course homework Series 3.5: for reference, it is best to write their own)
    2013-12-27 21:00:03下载
    积分:1
  • binary-search
    此代码为折半查找算法,适用于有序表,欢迎各位下载(This code is the binary search algorithm for ordered lists )
    2011-07-06 15:50:17下载
    积分:1
  • process_schedule
    演示进程调度算法 使用的链表 包涵7个功能 4个算法(Process Scheduling Algorithm Demo )
    2011-12-24 10:52:17下载
    积分:1
  • paixu
    使用的排序算法,非常不错的思维,比较其他有较大优势(Sorting algorithm used, very good ideas, have greater advantages compared with other)
    2009-05-05 17:54:54下载
    积分:1
  • mataqipan
    马踏棋盘的贪心算法,8*8棋盘,基本上不用回溯。(horse riding chessboard of the greedy algorithm, 8* 8 chessboard, basically not retroactive.)
    2006-05-30 20:05:17下载
    积分:1
  • Subset
    说明:  子集和数问题.rar,用C++写的,可以运行(Subset of several problems. Rar, written in C++, you can run)
    2010-04-16 17:42:12下载
    积分:1
  • class
    给定m个n维向量a , a , ,am 1 2  ,向量分类问题要求将相同的向量划分为同一类。试用 抽象数据类型表设计解向量分类问题的有效算法。(Given m a n-dimensional vector a, a,, am 1 2 )
    2008-05-05 22:03:41下载
    积分:1
  • erchashu
    平衡二叉树操作,可以输入数字形成二叉树,可以进行添加、删除操作(Balanced binary tree operation, you can enter numbers to form a binary tree, the user can add, delete)
    2011-12-23 10:26:26下载
    积分:1
  • tree
    二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)
    2013-07-09 13:39:31下载
    积分:1
  • Campus-navigation-problem
    校园导航问题,设计你的学校的平面图,至少包括10个以上的景点(场所),每两个景点间可以有不同的路,且路长也可能不同,找出从任意景点到达另一景点的最佳路径(最短路径)。 要求: (1)以图中顶点表示校园内各景点,存放景点名称、代号、简介等信息;以边表示路径,存放路径长度等有关信息。 (2)为来访客人提供图中任意景点相关信息的查询。 (3)为来访客人提供任意景点的问路查询,即查询任意两个景点之间的一条最短路径。 (4)修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)
    2011-08-12 10:34:14下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载