HUNAN UNIVERSITY ACM/ICPC Judge Online_Problem 10010_Recaman's Sequence

最新推荐文章于 2013-11-13 12:03:03 发布

yangchun57

最新推荐文章于 2013-11-13 12:03:03 发布

阅读量807

点赞数

分类专栏： HUNAN UNIVERSITY ACM/ICPC Judge Online 试题文章标签： input integer output numbers each date

本文链接：https://blog.csdn.net/yangchun57/article/details/2572365

版权

HUNAN UNIVERSITY ACM/ICPC Judge Online 试题专栏收录该内容

14 篇文章 2 订阅

订阅专栏

Recaman's Sequence

Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB

Total submit users: 549, Accepted users: 471

Problem 10010 : No special judgement

Problem 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

7
10000
-1

Sample Output

20
18658

Problem Source

Shanghai-P 2004

CODE

/*

  Name:  10010_Recaman's Sequence

  Copyright:  yangchun's

  Author:  yangchun

  Date:  20-06-08 22:27

  Description:  HUNAN UNIVERSITY ACM/ICPC Judge Online_Problem 10010_Recaman's Sequence

*/



#include <algorithm>

#include <iostream>



using namespace std;



long sequence[500000];

int _sequence[5000000];



int main()

{

   // freopen("in.txt","r",stdin);

    //freopen("out.txt","w",stdout);

    

    sequence[0] = 0;

    for(long m=1; m<500000; m++)

    {

        sequence[m] = sequence[m-1] - m;

        if(sequence[m] <=0 || _sequence[sequence[m]] == 1)

            sequence[m] = sequence[m-1] + m;

        _sequence[sequence[m]] = 1;

    }

    

    long n=0;

    while(scanf("%d",&n),n!=-1)

        printf("%ld/n",sequence[n]);

    

    return 0;

}