Recaman's Sequence

2014年3月1日 - DescriptionThe Recaman's sequence is defined by a0 = 0 ; for m > 0, am = am−1 − m if the rsulting am is positive and not already in ...

2016年5月11日 - Recaman's SequenceTime Limit:3000MS     Memory Limit:60000KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe ...

2012年4月3日 - 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 ... POJ2081 比较...

2014年4月24日 - Recaman's SequenceTime Limit: 3000MS Memory Limit: 60000KTotal Submissions: 20800 Accepted: 8829DescriptionThe Recaman's sequence is defin...

Recamán's sequence (or Recaman's sequence): a(0) = 0; for n > 0, a(n) = a(n-1) - n if positive and not already in the sequence, ...oeis.org/A005132  - 百度快照 - 评价 - 翻译此页

2009年7月26日 - Recaman's Sequence,坦然的网易博客,工作了,有时间应该回学校去看看!,一个自己觉得难快乐的人!

Problem 1304 Recaman's Sequence

最佳答案: dynamic programming + recursion