_kiko

摘要： Educational Codeforces Round 33 A. Chess For Three 模拟 view code #pragma GCC optimize("O3") #pragma GCC optimize("Ofast,no-stack-protector") #include<b 阅读全文

摘要： Educational Codeforces Round 32 A. Local Extrema 枚举每个位置 view code #pragma GCC optimize("O3") #pragma GCC optimize("Ofast,no-stack-protector") #include 阅读全文

摘要： Educational Codeforces Round 31 A. Book Reading 暴力 view code #pragma GCC optimize("O3") #pragma GCC optimize("Ofast,no-stack-protector") #include<bits 阅读全文

摘要： Educational Codeforces Round 30 A. Chores 把最大的换掉 view code #pragma GCC optimize("O3") #pragma GCC optimize("Ofast,no-stack-protector") #include<bits/s 阅读全文

摘要： Educational Codeforces Round 29 A. Quasi-palindrome 把后缀$0$去掉之后看一下串翻转之后和原串是否相同即可 view code #pragma GCC optimize("O3") #pragma GCC optimize("Ofast,no-st 阅读全文

摘要： Educational Codeforces Round 28 A. Curriculum Vitae 找分界点，前面全取$0$后面全取$1$即可 view code #pragma GCC optimize("O3") #pragma GCC optimize("Ofast,no-stack-pr 阅读全文

摘要： Educational Codeforces Round 27 A. Chess Tourney 拿第一队最弱的和第二队最强的比就好了 view code #pragma GCC optimize("O3") #pragma GCC optimize("Ofast,no-stack-protecto 阅读全文

摘要： Educational Codeforces Round 26 A. Text Volume 每个单词计算一下取个$\max$ view code #pragma GCC optimize("O3") #pragma GCC optimize("Ofast,no-stack-protector") 阅读全文

摘要： Educational Codeforces Round 25 A. Binary Protocol 开头和结尾添上$0$，然后找出所有$0$的位置，把相邻位置的差字符串连接起来就好了 view code #pragma GCC optimize("O3") #pragma GCC optimize 阅读全文

摘要： Educational Codeforces Round 24 A.Diplomas and Certificates \(a+k\cdot a\le \lfloor \frac n2\rfloor\rightarrow a\le \lfloor \frac{\lfloor \frac n2\rfl 阅读全文