D 牛牛与整除分块（打表找规律）

传送门

---

题目大意

给定$n$，求出集合 S = { ⌊ x i ⌋ ∣ i ∈ [ 1 , n ] } S = \{\lfloor \frac{x}{i}\rfloor | i \in[1,n]\} S={⌊ix​⌋∣i∈[1,n]}，然后对集合$S$去重并降序排序得到新集合$S^{\prime }$。给定$x$，求$\lfloor \frac{x}{i}\rfloor$在集合$S^{\prime }$中是第几大。

解题思路

首先1-100打表每个数对应的集合，然后就是找规律了，这个题如何找呢，首先不难发现$x$比较小时，那么$x$是几答案就是几，测试几个数后不难发现这个界限在$\sqrt{n}$附近，先假设为$\sqrt{n}$，当$x$大于界限时，有时候会有$\sqrt{n}$个数，有时候会有$\sqrt{n}-1$个数，然后我们可以发现当一个数恰为平方数时，其后面的$\sqrt{n}-1$个数和它一样，答案为$2\ast \sqrt{n}-\lfloor \frac{n}{x}\rfloor$，否则答案为$2\ast \sqrt{n}-\lfloor \frac{n}{x}\rfloor +1$

//
// Created by Happig on 2021/2/21.
//
#include <bits/stdc++.h>
#include <unordered_map>

using namespace std;
#define ENDL "\n"
#define lowbit(x) (x & (-x))
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const double dinf = 1e300;
const ll INF = 1e18;
const int Mod = 1e9 + 7;
const int maxn = 2e5 + 10;

set<int> s[105];

void table() {
    for (int i = 1; i <= 100; i++) {
        for (int j = 1; j <= i; j++) {
            s[i].insert(i / j);
        }
        cout << i << ": ";
        for (auto j = s[i].rbegin(); j != s[i].rend(); j++) cout << *j << " ";
        cout << endl;
    }
}

int getAns(int n, int x) {
    int cnt = 1, cur = n / x;
    for (auto j = s[n].rbegin(); j != s[n].rend(); j++, cnt++) {
        if (*j == cur) {
            return cnt;
        }
    }
    return 0;
}

int solve(int n, int x) {
    int m = sqrt(n);
    int temp;
    if (m * m == n || n - m * m < m) {
        temp = m;
    } else temp = m + 1;
    if (x <= temp) {
        return x;
    } else {
        return temp + m - n / x;
    }
}

void duipai() {
    for (int i = 1; i <= 100; i++) {
        for (int j = 1; j <= i; j++) {
            if (getAns(i, j) != solve(i, j)) {
                cout << i << " " << j << endl;
            }
        }
    }
}

int main() {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
//    table();
//    duipai();
//    cout << "finish duipai" << endl;
    int t, n, x;
    cin >> t;
    while (t--) {
        cin >> n >> x;
        int m = sqrt(n);
        int temp;
        if (m * m == n || n - m * m < m) {
            temp = m;
        } else temp = m + 1;
        if (x <= temp) {
            cout << x << ENDL;
        } else {
            cout << temp + m - n / x << ENDL;
        }
    }
    return 0;
}