This topic created in 4758 days ago, the information mentioned may be changed or developed.
10 replies • 1970-01-01 08:00:00 +08:00
 |
4
soarscnu Jun 19, 2013
so easy.
|
 |
6
Haveack Jun 19, 2013
双重的Fibonacci, 挺有意思的
|
 |
7
aec4d Jun 19, 2013  1
|
 |
8
caomu Jun 19, 2013 1
列目录。。。
|
 |
10
qiongqi Jun 19, 2013
F(n) = F(n-1) + 2^G(n)
G(n) = G(n-1) + G(n-2) + 1, 其中，G(0) = 1, G(1) = 2 数学上是这么表示吗？都还给老师了 |
Select Language