K好数

所属分类书籍源码
开发工具:C/C++
文件大小:197KB
下载次数:0
上传日期:2020-05-23 20:19:41
上 传 者阿凡达与
说明:  如果一个自然数N的K进制表示中任意的相邻的两位都不是相邻的数字,那么我们就说这个数是K好数。求L位K进制数中K好数的数目。例如K = 4,L = 2的时候(二位四进制数),K好数为11、13、20、22、30、31、33 共7个。随着L和K的变大,这个K数目很大,请你输出它对1000000007取模后的值为。
(If any two adjacent digits in the k-ary representation of a natural number n are not adjacent digits, then we say that this number is k-good. Find the number of K good numbers in the L-bit k-ary number. For example, when k = 4 and L = 2 (binary quaternary number), there are 7 good numbers of K, including 11, 13, 20, 22, 30, 31 and 33. With the increase of L and K, the number of K is very large. Please output the value after taking the modulus of 1000000007 as.)

文件列表:[举报垃圾]
chapter3\Bpfun.m, 1282 , 2010-11-14
chapter3\bs2rv.m, 3217 , 1998-04-22
chapter3\callbackfun.m, 1864 , 2011-03-31
chapter3\Code.m, 389 , 2010-08-23
chapter3\crtbase.m, 1168 , 1998-04-22
chapter3\crtbp.m, 2187 , 1998-04-22
chapter3\GABPMain.m, 2217 , 2020-05-23
chapter3\matlab.mat, 187295 , 2020-05-23
chapter3\mut.m, 1609 , 1998-04-22
chapter3\Objfun.m, 404 , 2010-11-14
chapter3\ranking.m, 4709 , 1998-04-22
chapter3\recombin.m, 2438 , 1998-04-22
chapter3\reins.m, 5574 , 1998-04-22
chapter3\select.m, 2401 , 1998-04-22
chapter3\sus.m, 1319 , 1998-04-22
chapter3\test.m, 269 , 2010-08-23
chapter3\xovmp.m, 2795 , 1998-04-22
chapter3\xovsp.m, 1043 , 1998-04-22
k好数.c, 885 , 2020-05-22
chapter3, 0 , 2020-05-23

近期下载者

相关文件

评论我要评论

收藏者