Codeforces Round #598 (Div. 3)
传送门 A. Payment Without Change 签到。 Code B. Minimize the Permutation 题意： 给出一个\(1\)~\(n\)的 ...
原文：Codeforces Round #598 (Div. 3) F. Equalizing Two Strings 构造
F. Equalizing Two Strings You are given two strings s and t both of length n and both consisting of lowercase Latin letters. In one move, you can choose any length len from to n and perform the follow ...
2019-11-05 15:58 1 267 推荐指数：
相关推荐
Codeforces Round #603 (Div. 2) F. Economic Difficulties dp
F. Economic Difficulties An electrical grid in Berland palaces consists of 2 grids: main and reserve. Wires in palaces are made of expensive ...
Codeforces Round #616 (Div. 2) F. Coffee Varieties 交互题
F. Coffee Varieties time limit per test1 second memory limit per test256 megabytes This is the easy version of the problem. You can find the hard ...
Codeforces Round #598 (Div. 3) C. Platforms Jumping
There is a river of width n">nn. The left bank of the river is cell 0">00 and the right bank is c ...
Educational Codeforces Round 80 (Rated for Div. 2)（C - Two Arrays ）
C - Two Arrays 题目链接：https://codeforces.com/contest/1288/problem/C 题目： 题意：给你n，m，利用1~n之间的数（可重复）来组成长度为m的数组a,b，要求数组a非递减,数组b非递增，且a数组的数 ...
【CF1256】Codeforces Round #598 (Div. 3) 【思维+贪心+DP】
https://codeforces.com/contest/1256 A：Payment Without Change【思维】 题意：给你a个价值n的物品和b个价值1的物品，问是否存在取物方案使得价值为s 题解：min(s/n,a)*n+b>=s?YES:NO B ...
Codeforces Round #598 (Div. 3) E. Yet Another Division Into Teams dp
E. Yet Another Division Into Teams There are n students at your university. The programming skill o ...
Codeforces Round #739 (Div. 3) ABCDEF1F2 解题思路
Codeforces Round #739 (Div. 3) 可能是一开始大佬都写F1去了，我在D写完后发现F过的人数比E多了好多（个位数与十位数），以为F1比较简单，就直接开F1了，但自己分类讨论老是考虑不完整，导致罚时直接垮掉 本来已经不想开E了，结果发现延长了15分钟，尝试着开一开 ...