摘要:
cf833 div2 B.Diverse Substrings statement Find the number of substrings of $s$ consists of only $'0' \to '9'$ that satisfies max{alpha occurrences} $\ 阅读全文
摘要:
链接:https://codeforces.com/contest/1560 总体评价:区分度不错,比之前的div3要难一些。 A 预处理出前$1000$个,直接输出即可。 #include <bits/stdc++.h> const int N = 100050; const int INF = 阅读全文