文件名称:1
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
关于Recaman s序列的问题，一个简单解决方法，保证时间和空间的限制。-The Recaman s sequence is defined by a0 = 0 for m > 0, am = am-1- m if the resulting am is positive and not already in the sequence, otherwise am = am-1+ m.
The first few numbers in the Recaman s Sequence is 0, 1, 3, 6, 2, 7, 13, 20, 12, 21, 11, 22, 10, 23, 9... . Given k, your task is to calculate ak.
The first few numbers in the Recaman s Sequence is 0, 1, 3, 6, 2, 7, 13, 20, 12, 21, 11, 22, 10, 23, 9... . Given k, your task is to calculate ak.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
1
.\problem.doc
.\solution.cpp
.\problem.doc
.\solution.cpp