Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Recaman's Sequence
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 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator