欧某上分之路——笔记走起,又收获一个!
小王子说:蓝桥杯填空题越来越小变态了!
点击下面链接直达:
题目描述:
代码:
法1:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
double H = 11625907.5798;
const ll N = 23333333;
bool check(ll x) {
double p0 = x * 1.0 / N, p1 = 1 - p0;
double h = (x * p0 * log2(p0) + (N - x) * p1 * log2(p1));
return abs(h+H)<1e-4;
}
int main () {
for (int x = 1; x <= N / 2; x ++) {
if (check(x)) cout << x << endl;
}
return 0;
}
法2:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll H = 116259075798;
const ll N = 23333333;
bool check(ll x) {
double p0 = x * 1.0 / N, p1 = 1 - p0;
ll h = 10000* (x * p0 * log2(p0) + (N - x) * p1 * log2(p1));
return h + H ==0;
}
int main () {
for (int x = 1; x <= N / 2; x ++) {
if (check(x)) cout << x << endl;
}
return 0;
}
总结:
思路:数论题目!然后学到新知识:模板自带的log2()函数
法1:注意abs(h+H)<1e-4; 因为浮点比较有误差,小数点第四位开始就不同了!,需要两者相减绝对值 小于1e-4 次方(小数点几位就 1e- 几)=》相等!
法2:要么直接变成整数比较方便,不需要考虑后面