[CF1399] Codeforces Round #661 (Div. 3)
# Name A Remove Smallest x16658 B Gifts Fixing x15673 ...
原文：Codeforces Round #661 (Div. 3) A. Remove Smallest
You are given the array aa a consisting of n positive greater than zero integers. In one move, you can choose two indices i and j i j such that the absolute difference between a i and a j is no more t ...
2020-08-07 14:21 0 482 推荐指数：
相关推荐
Codeforces Round #661 (Div. 3) B. Gifts Fixing（思维）
You have n gifts and you want to give all of them to children. Of course, you don't want to offend a ...
Codeforces Round #599 (Div. 1) A. Tile Painting 数论
C. Tile Painting Ujan has been lazy lately, but now has decided to bring his yard to good shape. Fi ...
Educational Codeforces Round 108 (Rated for Div. 2) A. Red and Blue Beans（思维）
You have r red and b blue beans. You'd like to distribute them among several (maybe, one) packets in ...
Codeforces Round #356 (Div. 2) A. Bear and Five Cards 水题
A. Bear and Five Cards 题目连接： http://www.codeforces.com/contest/680/problem/A Description A little bear Limak plays a game. He has five ...
Codeforces Round #556 (Div. 1)
Codeforces Round #556 (Div. 1) A. Prefix Sum Primes 给你一堆1,2，你可以任意排序，要求你输出的数列的前缀和中质数个数最大。 发现只有\(2\)是偶质数，那么我们先放一个\(2\)，再放一个\(1\)，接下来把\(2\)全部放掉 ...
Codeforces Round #560 Div. 3
题目链接；戳我 于是。。。风浔凌弱菜又去写了一场div.3 总的来说，真的是比较简单.......就是.......不开long long见祖宗 贴上题解—— A 给定一个数，为01串，每次可以翻转一个位置上的数，问最少几步可以使得它模\(10^x\)余\(10^y\) 从后往前贪心 ...
Codeforces Round #745 (Div. 2)
A. CQXYM Count Permutations 思路： 答案是(2n)!/2，不知道啥原理，靠样例猜。 题目的描述是： 而这种情况答案是(2n)!/2，这占了全排列一半的情况，那么另一半的情况应该是 即这种情况答案应该也是(2n)!/2 而这个题防止意外 ...