/*
2011-7-29
author:BearFly1990
test:zoj_2421 Recaman's Sequence
*/
import java.util.HashSet;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int[] a = new int [500001];
int[] b = new int [4000020];
for(int i = 1; i < 500001; i++){
a[i] = a[i-1] - i;
if(a[i] <=0 || b[a[i]] == 1){
a[i] = a[i-1] + i;
}
b[a[i]] = 1;
}
while(cin.hasNext()){
int k = cin.nextInt();
if(k == -1)break;
System.out.println(a[k]);
}
}
}
zoj 2421 Recaman's Sequence(水)
最新推荐文章于 2021-03-23 22:25:51 发布