###### POJ 2081

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 …

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

import java.util.Arrays;
import java.util.Scanner;

public class Test1 {
private static int[] array = new int[500005];
private static boolean[] flag = new boolean[10000000];
public static void main(String[] args) {
Arrays.fill(flag, false);
Arrays.fill(array, 0);
for (int i = 1; i <=500000 ; i++) {
if (array[i-1]-i>0 && flag[array[i-1]-i]==false) {
array[i] = array[i-1]-i;
}else
array[i]= array[i-1]+i;
flag[array[i]] = true;

}
Scanner scanner = new Scanner(System.in);
while (scanner.hasNext()) {
int n = scanner.nextInt();
if (n<0)
break;
System.out.println(array[n]);
}
scanner.close();
}

}


#### poj 2081 简单递推

2015-02-06 19:59:57

#### 杭电acm--2081

2015-09-19 21:56:03

#### 杭电ACM 2081:手机短号

2015-05-11 20:16:44

#### POJ——2081

2015-07-13 21:25:27

#### HDU 2081 -- 手机短号

2015-01-17 16:41:44

#### poj 2081

2010-03-06 22:53:00

#### poj解题报告——2081

2015-03-01 14:00:13

#### poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告poj 解题报告

2009年10月06日 9KB 下载

#### POJ 2081 JAVA

2015-11-12 18:19:23

#### POJ 2081 解题报告

2015-04-15 01:49:17

POJ 2081