发表评论取消回复
相关阅读
相关 Educational Codeforces Round 72 Editorial(Rated for Div. 2)(A、B、C)
A. Creating a Character][] 水题考虑的情况不够 **Wrong answer on test 3** 思路:3种情况 1.如果str>...
相关 Codeforces Round #841 (Div. 2) and Divide by Zero【异或差分+动态map维护】 2022 C. Even Subarrays
[Problem - C - Codeforces][] 题意: 给定一个数列,统计有多少子串的异或和的约数个数是偶数 思路: 首先,关于约数个数: 当提及约数个数时
相关 Codeforces Round #746 (Div. 2) C. Bakry and Partitioning
本文首发于微信公众号:"算法与编程之美",欢迎关注,及时了解更多此系列文章。 前言 题目来源 :Codeforces Round\746 (Div. 2) 链
相关 Codeforces Round #324 (Div. 2) B. Kolya and Tanya
思路:因为题目说只要存在组ai?+?ai?+?n?+?ai?+?2n?≠?6就令人满意,也就是不满意的情况就是所有ai?+?ai?+?n?+?ai?+?2n?都等于6 那就用
相关 Codeforces Round #320 (Div. 1) C. Weakness and Poorness
具有很明显的单峰性质 直接三分,用动态规划的方式求出weekness 注意三分的时候,很多人用eps来判断三分结束,这样有一些精度误差 直接三分100次即可
相关 Editorial Divide by Zero and Codeforces Round #399 (Div. 1+2, combined) (A~F)
[CF \399][CF _399] A题:水题 代码: include<bits/stdc++.h> using namespace std;
相关 Codeforces Round #438 (Div. 1 + Div. 2 combined) B. Race Against Time(模拟)
B. Race Against Time time limit per test 2 seconds memory limit per test 256 megabyt
相关 Codeforces Round #438 (Div. 1 + Div. 2 combined) A. Bark to Unlock(模拟)
A. Bark to Unlock time limit per test 2 seconds memory limit per test 256 megabytes
相关 D. Zero Quantity Maximization(CF: Codeforces Round #544 (Div. 3))
题目描述: You are given two arrays aa and bb, each contains nn integers. You want to cre
相关 Codeforces Round #533(Div. 2) B.Zuhair and Strings
链接:https://codeforces.com/contest/1105/problem/B 题意: 给一个字符串和k,连续k个相同的字符,可使等级x加1,
还没有评论,来说两句吧...