文件名称:kangtuo
介绍说明--下载内容来自于网络,使用问题请自行百度
The Cantor expansion of the natural number x is
x = ak * k!+a(k − 1) *(k − 1)!+.... + a2 * 2!+a1*1!
where all the ai (digits) satisfy 0 ≤ ai ≤ i
it is easy to find a algorithm,we find the largest integer k that can satisfy 给一个正整数求出它的康拓展开
离散数学the definition first,then fix ak and substract ak * k from x,so we can fix ai ,0 ≤ i ≤ k
-Given a positive integer , find the Cantor expansion of this integer
x = ak * k!+a(k − 1) *(k − 1)!+.... + a2 * 2!+a1*1!
where all the ai (digits) satisfy 0 ≤ ai ≤ i
it is easy to find a algorithm,we find the largest integer k that can satisfy 给一个正整数求出它的康拓展开
离散数学the definition first,then fix ak and substract ak * k from x,so we can fix ai ,0 ≤ i ≤ k
-Given a positive integer , find the Cantor expansion of this integer
(系统自动生成,下载前可以参看下载内容)
下载文件列表
kangtuo/康拓展开.cpp
kangtuo/康拓展开.doc
kangtuo
kangtuo/康拓展开.doc
kangtuo
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.