[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 而這個題防止意外 ...