【省赛】【提高】1561 - 买木头

问题描述：

输入&输出：

C++代码：

#include<bits/stdc++.h>
using namespace std;
const int N = 1000010;
long long n, m, l[N], s[N];
bool check(long long x) {
	long long cnt = 0;
	for (int i = 0; i < n; i++)cnt += (l[i] / x) * s[i];
	return cnt >= m;
}
int main() {
	cin.tie(0);
	cin >> n >> m >> l[0] >> s[0];
	for (int i = 1; i < n; i++) {
		l[i] = ((l[i - 1] * 37011 + 10193) % (10000)) + 1;
		s[i] = ((s[i - 1] * 73011 + 24793) % (100)) + 1;
	}
	long long l = 1, r = 1e18, ans = 0;
	while (l <= r) {
		long long mid = (l + r) >> 1;
		if (check(mid)) {
			ans = mid;
			l = mid + 1;
		} else r = mid - 1;
	}
	cout << ans;
	return 0;
}

求求了！点个赞，关个注吧！