poj 2081

打表

#include <stdio.h>
#include <iostream>
#include <cstring>
const int maxn = 550000;
const int maxnum = 10000000;
using namespace std;
int result[maxn];
bool flag[maxnum];
int main()
{
    memset(flag,false,sizeof(flag));
    for(int i=1; i<=500000; i++)
    {
        if(result[i-1]-i>0&&flag[result[i-1]-i]==false)
            result[i] = result[i-1]-i;
        else
            result[i] = result[i-1]+i;
            flag[result[i]] = true;
    }
    int n;
    while(scanf("%d",&n) && n != -1)
        printf("%d\n",result[n]);
    return 0;
}