01 2021 档案
摘要:Educational Codeforces Round 103 (Rated for Div. 2) A - K-divisible Sum int main() { IOS; for (cin >> _; _; --_) { ll n, k; cin >> n >> k; k = ((n - 1
阅读全文
摘要:Codeforces Round #696 (Div. 2) A - Puzzle From the Future 贪心, 让长度最长, 每次试 +1, int main() { IOS; for (cin >> _; _; --_) { string s; cin >> n >> s; m = -
阅读全文
摘要:2017 ECNA Regional Contest A B C 模拟 int main() { IOS; string s; cin >> s; int x = 0, y = 0; rep(i, 0, s.size() - 2 >> 1) x += s[i] - 'A', y += s[i + (
阅读全文
摘要:2018 Benelux Algorithm Programming Contest (BAPC 18) A - A Prize No One Can Win int main() { IOS; cin >> n >> m; VI a(n); k = 1; for (auto &i : a) cin
阅读全文
摘要:模拟 + dp 场?
阅读全文
摘要:算法竞赛进阶指南 基本算法 位运算 a^b ll a, b, p; ll qpow(ll a, ll b) { ll ans = 1 % p; for (; b; b >>= 1, a = a * a % p) if (b & 1) ans = ans * a % p; return ans; }
阅读全文
摘要:
阅读全文
![](https://images.cnblogs.com/cnblogs_com/2aptx4869/1811094/o_2101071324105cd1a338e7bce75defa5d681.jpg)
摘要:牛客练习赛75 幸好最后选择了飞机, 火车不然就被隔离了 在家效率是真的低, 脑子还不想动 A 广义肥波 线性推一下, 就行, 无非取膜的mod把人卡住, 对于指数要取膜mod-1的 p ∈ prime, a % p != 0, a^(p - 1) ≡ 1 (mod p), 故 a^(x) = a^
阅读全文