2017年11月1日提高组T1 第k小数

Description

---

Input

---

Output

---

Hint

---

Solution

---

正难则反，可以二分一个答案然后判断rank。问题就变成了求

$$\sum_{i=1}^{n}\lfloor{\frac{mid}{i}} \rfloor$$

这样暴力的做是会T的，不难发现对于一个$\lfloor\frac{n}{a}\rfloor$最多只有$2\sqrt{n}$种取值，我们分块记录相同的答案然后跳着做就可以了

Code

---

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#define rep(i, st, ed) for (int i = st; i <= ed; i += 1)
#define drp(i, st, ed) for (int i = st; i >= ed; i -= 1)
#define erg(i, st) for (int i = ls[st]; i; i = e[i].next)
#define fill(x, t) memset(x, t, sizeof(x))
#define min(x, y) ((x)<(y)?(x):(y))
#define max(x, y) ((x)>(y)?(x):(y))
#define ld long double
#define db double
#define ll long long
#define INF 0x3f3f3f3f
#define N 1001
#define E 1001
#define L 1001
inline ll read() {
    ll x = 0, v = 1;
    char ch = getchar();
    for (; ch < '0' || ch > '9'; v *= (ch == '-')?(-1):(1), ch = getchar());
    for (; ch <= '9' && ch >= '0'; (x *= 10) += ch - '0', ch = getchar());
    return x * v;
}
inline ll check(ll n, ll lim) {
    lim = min(lim, n);
    ll ret = 0;
    for (ll i = 1, p = 0; i <= lim; i = 1 + p) {
        p = min(n, lim / (lim / i));
        ret += (lim / i) * (p - i + 1);
    }
    return ret;
}
int main(void) {
    std:: ios:: sync_with_stdio(false);
    ll n = read();
    ll m = read();
    if (n > m) {
        n ^= m;
        m ^= n;
        n ^= m;
    }
    ll q = read();
    while (q --) {
        ll x = read();
        ll l = 0;
        ll r = x;
        ll ans = 0;
        while (l <= r) {
            ll mid = (l + r) >> 1;
            ll prt = check(n, mid);
            if (prt < x) {
                l = mid + 1;
            } else {
                ans = mid;
                r = mid - 1;
            }
        }
        std:: cout << ans << std:: endl;
    }
    return 0;
}