|
|
A318271型 |
| 考虑到组成员的穿越时间由中的第n个分区给出,桥火问题的最佳穿越时间A026791号. |
|
0
|
|
|
1, 1, 2, 3, 2, 3, 5, 4, 3, 2, 4, 7, 6, 5, 5, 4, 3, 5, 9, 8, 7, 6, 6, 6, 5, 6, 4, 3, 6, 11, 10, 9, 8, 8, 7, 7, 8, 7, 7, 6, 7, 5, 4, 7, 13, 12, 11, 10, 10, 9, 9, 9, 8, 7, 8, 9, 8, 8, 7, 10, 8, 8, 6, 5, 4, 8, 15, 14, 13, 12, 12, 11, 11, 11, 10, 9, 10, 10, 9, 8, 9
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,3
|
|
链接
|
基于用户的man101,桥梁和火炬问题、编程难题和代码高尔夫堆栈交换。
|
|
例子
|
当穿越时间为[1,2,5,10]时,小组穿越的最小总时间为17分钟:
(2米)1和2交叉,
(1m)1次返回,
(10m)5和10交叉,
(2米)2回,
(2米)1和2交叉。
+----+--------------------+------+
|n|穿越次数|a(n)|
+----+--------------------+------+
|1|[1]|1|
|2|[1,1]|1|
| 3 | [2] | 2 |
| 4 | [1, 1, 1] | 3 |
| 5 | [1, 2] | 2 |
| 6 | [3] | 3 |
| 7 | [1, 1, 1, 1] | 5 |
| 8 | [1, 1, 2] | 4 |
| 9 | [1, 3] | 3 |
| 10 | [2, 2] | 2 |
| 11 | [4] | 4 |
| 12 | [1, 1, 1, 1, 1] | 7 |
| 13 | [1, 1, 1, 2] | 6 |
| 14 | [1, 1, 3] | 5 |
| 15 | [1, 2, 2] | 5 |
| 16 | [1, 4] | 4 |
| 17 | [2, 3] | 3 |
| 18 | [5] | 5 |
| 19 | [1, 1, 1, 1, 1, 1] | 9 |
| 20 | [1, 1, 1, 1, 2] | 8 |
| 21 | [1, 1, 1, 3] | 7 |
| 22 | [1, 1, 2, 2] | 6 |
| 23 | [1, 1, 4] | 6 |
| 24 | [1, 2, 3] | 6 |
| 25 | [1, 5] | 5 |
| 26 | [2, 2, 2] | 6 |
| 27 | [2, 4] | 4 |
| 28 | [3, 3] | 3 |
| 29 | [6] | 6 |
+----+--------------------+------+
|
|
黄体脂酮素
|
(朱莉娅)
功能BT(p)
n=长度(p)
p[结束]=-(总和(p)+(n>2?(n-3)*p[1]:0))
如果n>=3
q=2p[2]-p[1];tog=假
对于n-1中的k:-1:1
(tog=~tog)&&p[k]>q?p[k]-=q:p[k]=0
结束
结束
-和(p)结束
|
|
交叉参考
|
|
|
关键字
|
非n,美好的
|
|
作者
|
|
|
扩展
|
使用CodeGolf StackExchange的Erwan程序添加的第a(45)条及以上条款安德烈·扎博洛茨基2019年10月18日
|
|
状态
|
经核准的
|
|
|
|