{"id":1115,"date":"2009-11-29T12:53:48","date_gmt":"2009-11-29T04:53:48","guid":{"rendered":"http:\/\/www.slyar.com\/blog\/?p=1115"},"modified":"2022-07-03T15:46:59","modified_gmt":"2022-07-03T22:46:59","slug":"poj-2081-cpp","status":"publish","type":"post","link":"http:\/\/www.slyar.com\/blog\/poj-2081-cpp.html","title":{"rendered":"POJ 2081 Recaman's Sequence C++\u7248"},"content":{"rendered":"

\u6587\u7ae0\u4f5c\u8005\uff1a\u59dc\u5357(Slyar) <\/span>\u6587\u7ae0\u6765\u6e90\uff1aSlyar Home (www.slyar.com<\/a>) \u8f6c\u8f7d\u8bf7\u6ce8\u660e\uff0c\u8c22\u8c22\u5408\u4f5c\u3002<\/p>\n

\u6c34\u9898\uff0c\u5178\u578b\u7684\u7a7a\u95f4\u6362\u65f6\u95f4...<\/p>\n

<\/p>\n

Description<\/span><\/p>\n

The Recaman's sequence is defined by a0 = 0 ; for m > 0, am = am\u22121 \u2212 m if the rsulting am is positive and not already in the sequence, otherwise am = am\u22121 + m.
\nThe first few numbers in the Recaman's Sequence is 0, 1, 3, 6, 2, 7, 13, 20, 12, 21, 11, 22, 10, 23, 9 ...
\nGiven k, your task is to calculate ak.<\/p>\n

Input<\/span><\/p>\n

The input consists of several test cases. Each line of the input contains an integer k where 0 <= k <= 500000.
\nThe last line contains an integer \u22121, which should not be processed.<\/p>\n

Output<\/span><\/p>\n

For each k given in the input, print one line containing ak to the output.<\/p>\n

Sample Input<\/span><\/p>\n

7
\n10000
\n-1<\/p>\n

Sample Output<\/span><\/p>\n

20
\n18658<\/p>\n

Slyar:\u6ca1\u96be\u5ea6\uff0c\u6253\u8868\u5c31\u884c\u4e86\uff0c\u6807\u8bb0\u6570\u7ec4\u5f00\u5230260W\u5c31\u5dee\u4e0d\u591a\u4e86\uff0c\u6211\u624d\u61d2\u5f97\u641c\u7d22...<\/span><\/p>\n

\r\n#include \r\n\r\nusing namespace std;\r\n\r\nchar ext[2600000] = {0};\r\nint a[500001];\r\n\r\nvoid reset()\r\n{\r\n    int i;\r\n    a[0] = 0;\r\n    ext[0] = 1;\r\n    for (i = 1; i <= 500000; i++)\r\n    {\r\n        a[i] = a[i-1] - i;\r\n        if (a[i] < 0 || ext[a[i]])\r\n        {\r\n            a[i] = a[i-1] + i;\r\n        }\r\n        ext[a[i]] = 1;\r\n    }\r\n}\r\n\r\nint main()\r\n{\r\n    int k;\r\n    reset();\r\n    while(cin >> k && k != -1)\r\n    {\r\n        cout << a[k] << endl;\r\n    }\r\n    \/\/system(\"pause\");\r\n    return 0;\r\n}\r\n<\/pre>\n
\u8f6c\u8f7d\u8bf7\u6ce8\u660e\uff1aSlyar Home<\/a> » POJ 2081 Recaman's Sequence C++\u7248<\/a><\/p>","protected":false},"excerpt":{"rendered":"
\u6587\u7ae0\u4f5c\u8005\uff1a\u59dc\u5357(Slyar) \u6587\u7ae0\u6765\u6e90\uff1aSlyar Home (www.slyar.com) \u8f6c\u8f7d\u8bf7\u6ce8\u660e\uff0c\u8c22\u8c22\u5408\u4f5c\u3002 \u6c34\u9898\uff0c\u5178\u578b\u7684\u7a7a\u95f4\u6362\u65f6\u95f4... \u8f6c\u8f7d\u8bf7\u6ce8\u660e\uff1aSlyar Home » POJ 2081 Recaman's Sequenc […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1103],"tags":[1006],"class_list":["post-1115","post","type-post","status-publish","format-standard","hentry","category-acm-oj-solution","tag-poj"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t