[动态规划]Recaman's Sequence

本文深入探讨了Recaman数列的定义及其生成规则,通过具体实例展示了数列的前几项,并提供了一段C语言代码实现,用于计算指定位置的数列值。文章适合对数学数列及算法实现感兴趣的读者。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Recaman's Sequence


Time Limit:5sMemory limit:32M
Accepted Submit:383Total Submit:1245

The Recaman's sequence is defined by a(0)=0; for m>0, a(m)=a(m-1)-m if the resulting a(m) is positive and not already in the sequence, otherwise a(m)=a(m-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 a(k).

Input

The input consists of several test cases. Each line of the input contains an integer k where 0<=k<=500000.
The last line contains an integer -1, which should not be processed.

Output

For each k given in the input, print one line containing a(k) to the output.

Sample Input

7
10000
-1

Sample Output

20
18658
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct Entry
{
    int i;
    int val;
    int next;
};

int flag[1000000];
int out[500010];

int main()
{
    int i, val, t;

    memset(flag, 0, sizeof(flag));
    flag[0] = 1;
    out[0] = 0;
    for (i = 1; i <= 500000; ++i)
    {
        t = out[i - 1] - i;
        if ((t < 0) || (flag[t / 32] & (1 << (t & 0x1F))))
            t = out[i - 1] + i;

        out[i] = t;
        flag[t / 32] |= (1 << (t & 0x1F));
    }

    while (scanf("%d", &val) && (val >= 0))
        printf("%d\n", out[val]);

    return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值