Loading docs/search/idastar.md +6 −5 Original line number Diff line number Diff line Loading @@ -120,7 +120,8 @@ bool dfs(int d, int from, LL aa, LL bb) { bool ok = false; from = max(from, get_first(aa, bb)); // 枚举的起点 for (int i = from;; i++) { // 剪枝:如果剩下的 maxd+1-d 个分数全部都是 1/i,加起来仍然不超过 aa/bb,则无解 // 剪枝:如果剩下的 maxd+1-d 个分数全部都是 1/i,加起来仍然不超过 // aa/bb,则无解 if (bb * (maxd + 1 - d) <= i * aa) break; v[d] = i; // 计算 aa/bb - 1/i,设结果为 a2/b2 Loading Loading
docs/search/idastar.md +6 −5 Original line number Diff line number Diff line Loading @@ -120,7 +120,8 @@ bool dfs(int d, int from, LL aa, LL bb) { bool ok = false; from = max(from, get_first(aa, bb)); // 枚举的起点 for (int i = from;; i++) { // 剪枝:如果剩下的 maxd+1-d 个分数全部都是 1/i,加起来仍然不超过 aa/bb,则无解 // 剪枝:如果剩下的 maxd+1-d 个分数全部都是 1/i,加起来仍然不超过 // aa/bb,则无解 if (bb * (maxd + 1 - d) <= i * aa) break; v[d] = i; // 计算 aa/bb - 1/i,设结果为 a2/b2 Loading