题意:类似1 1 2 1 2 3 1 2 3 4 ....的序列,问你第i位数是多少。
水题,二分或者分类讨论都可以。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 1000000
#define eps 1e-8
#define MAXN (10000+10)
#define MAXM (2000000+10)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while((a)--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
#pragma comment(linker, "/STACK:102400000,102400000")
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
int main()
{
LL n; Rl(n); n *= 2;
LL mid = sqrt(n);
LL l = mid-1, r = mid+1;
LL pos;
if(l * (l+1) >= n)
pos = l;
else if(mid * (mid+1) >= n)
pos = mid;
else
pos = r;
n /= 2; pos--;
LL yu = n - pos * (pos+1) / 2;
Pl(yu);
return 0;
}