12 2023 档案

Codeforces Round 916 (Div. 3) (A~F附带题解和详细思路)
摘要：Codeforces Round 916 (Div. 3) (A~E2) A. Problemsolving Log 签到题,对于给出的字符串,用数组记录每个字母出现的次数,然后遍历一边记录数组,如果对应的字母出现次数大于它的位次,则说明该字母对应的题目被解出来了,最后输出解题数量即可 void s 阅读全文
posted @ 2023-12-20 01:27 橙之夏 阅读(444) 评论(0) 推荐(0)
Educational Codeforces Round 160 (Rated for Div. 2) 题解A~D
摘要：Educational Codeforces Round 160 (Rated for Div. 2) A. Rating Increase 纯暴力,分割字符串,如果n1<n2就输出,如果遍历完整个数组都不存在n1<n2就输出-1. const int N = 2e5 + 10; int toint 阅读全文
posted @ 2023-12-19 20:12 橙之夏 阅读(104) 评论(2) 推荐(0)