Recaman's Sequence

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

fisher_jiang

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

阅读量2.4k

点赞数 1

分类专栏：算法与数据结构 STL 文章标签： input integer iostream output numbers each

本文链接：https://blog.csdn.net/fisher_jiang/article/details/671772

版权

算法与数据结构同时被 2 个专栏收录

66 篇文章 0 订阅

订阅专栏

STL

13 篇文章 0 订阅

订阅专栏

问题描述:

The Recaman's sequence is defined by a⁰ = 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

7
10000
-1

Sample Output

20
18658

#include <iostream>
#include <cstdio>
#include <map>
using namespace std;
long s[500005];
map<long ,bool>hash;

void init()
{
   long i,t;

    s[0] = 0;
    hash.clear();
    hash[0]=1;
    for(i=1; i<500003; i++)
    {
        t = s[i-1]-i;
        if(t<=0 || hash[t])
            s[i] = s[i-1]+i;
        else
            s[i] = t;
        hash[s[i]] = true;
    }
}

int main()
{
    int p;

    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    init();
    while(cin>>p && p!=-1)
        cout<<s[p]<<endl;
    return 0;
}