Codeforces Round #256 (Div. 2) - D - Multiplication Table

二分答案

#include <cstring>
#include <iostream>
#include <cstdlib>
#include <cctype>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#define INF (int)(1e9)
#define maxn 100010
using namespace std;
typedef long long ll;
ll n, m, k;
ll check(ll a) {
    ll res = 0;
    for (int i = 1; i <= n; ++ i) {
        if (a/i) {
            res += min(a/i, m);
        }
        else {
            return res;
        }
    }
    return res;
}
int main() {
    while (cin >> n >> m >> k) {
        ll l = 1, r = k, m, tmp;
        while (l < r) {
            m = (l + r) >> 1;
            tmp = check(m);
            if (tmp >= k) r = m;
            else l = m+1;
        }
        cout << l << endl;
    }
}