POJ2081 Recaman's Sequence

最新推荐文章于 2019-02-19 13:06:03 发布

原创最新推荐文章于 2019-02-19 13:06:03 发布 · 235 阅读

CC 4.0 BY-SA版权

本文深入探讨了Recaman序列的定义及其算法实现，通过具体的代码示例解释了如何计算序列中的任意一项。Recaman序列是一种数学序列，其每一项都依赖于前一项，通过加减当前索引来决定。文章提供了完整的C++代码实现，并使用了哈希表来确保序列的唯一性和正确性。

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

Description

The Recaman's sequence is defined by a0 = 0 ; for m > 0, a _m = a _m−1 − m if the rsulting 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

710000-1

Sample Output

题目意思不难理解就是第m个位置的数是根据第m-1位置的数推出来的如果a[m-1]-m>0，并且a[m-1]-m在前面的序列中没有出现过那么a[m] = a[m-1]-m否则a[m] = a[m-1]+m

#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int a[500005]={0};bool hash[10000000]={false};int main(){    int i;    for(i = 1;i<= 500000;i++)    {        if(a[i-1]-i>0 && !hash[a[i-1]-i])        a[i] = a[i-1]-i;        else        a[i] = a[i-1]+i;        hash[a[i]] = true;//hash[a[i]] = true,标志为已经出现过    }    while(~scanf("%d",&i),i>=0)    printf("%d\n",a[i]);    return 0;}