poj 2081

最新推荐文章于 2021-02-08 10:58:47 发布

FawkesLi

最新推荐文章于 2021-02-08 10:58:47 发布

阅读量152

点赞数

CC 4.0 BY-SA版权

分类专栏：算法水题

本文链接：https://blog.youkuaiyun.com/Fawkess/article/details/105635058

算法同时被 2 个专栏收录

143 篇文章

订阅专栏

水题

13 篇文章

订阅专栏

#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int

using namespace std;

#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>

#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int

using namespace std;

int n,temp;
int v[5111111];
int a[511111];

int main() {
	a[0] = 0;
	memset(v, 0, sizeof(v));
	for (int i = 1; i <= 500000; i++) {
		a[i] = a[i - 1] - i;
		if (a[i] <= 0 || v[a[i]] != 0)
			a[i] = a[i - 1] + i;
		v[a[i]] = 1;
	}

	while (scanf("%d", &n), n != -1)
		printf("%d\n", a[n]);
	
	return 0;
}