2081 Recaman's Sequence 水题报告
2009-03-04 10:54
316 查看
#include<iostream> #include<stdio.h> using namespace std; bool in[10000000]; int d[500010]; int main() { int tmp = d[0] = 0; for(int i = 1; i <= 500000; i ++) { if(tmp > i && !in[tmp-i]) tmp -= i; else tmp += i; in[tmp] = true; d[i] = tmp; } int n; while(cin >> n && n > -1) { cout << d << endl; } return 0; }
相关文章推荐
- Pku acm 2081 Recaman's Sequence 动态规划题目解题报告(三)
- POJ 2081 Recaman's Sequence 解题报告
- Poj 2081 Recaman's Sequence之解题报告
- POJ-2081-Recaman's Sequence-Hash思想解题
- poj 2081 Recaman's Sequence【hash】
- Recaman's Sequence
- smoj—Recaman's Sequence
- Pku acm 2492 A Bug's Life数据结构题目解题报告(十)---- 并查集的应用
- ZOJ - 2421 Recaman's Sequence(打表水题)
- POJ 2081 Recaman's Sequence
- POJ 2081 Recaman's Sequence
- pku2081----Recaman's Sequence(按所给的递推公式来做就行)
- pku 2623 sequence median 水题 解题报告
- poj2081 Recaman's Sequence
- 解题报告 之 POJ3686 The Windy's
- 解题报告:codeforces #339(Div.2)B.Gena's Code
- poj 2081【Recaman's Sequence】
- POJ 2081 Recaman's Sequence
- 第八届山东省ACM省赛解题报告(一)(水题&签到)
- LeetCode解题报告—— Jump Game & Merge Intervals & Permutation Sequence