gravity.sekai-CSDN博客

原创 Codeforces Round #698 (Div. 2)

A. Nezzar and Colorful BallsNezzar has n balls, numbered with integers 1,2,…,n. Numbers a1,a2,…,an are written on them, respectively. Numbers on those balls form a non-decreasing sequence, which means that ai≤ai+1 for all 1≤i<n.Nezzar wants to color t

2021-02-07 10:18:46 164

原创 AtCoder Beginner Contest 189 寒假训练题解

A - SlotProblem StatementYou are playing the slots.The result of a spin is represented by three uppercase English letters C1, C2, and C3. It is considered a win when all of them are the same letter.Determine whether it is a win.ConstraintsCi is an up

2021-01-27 07:10:39 338 1

原创 AtCoder Beginner Contest 188 寒假训练题解

A - Three-Point ShotProblem StatementA basketball game is being played, and the score is nowX-Y. Here, it is guaranteed that X≠Y.Can the team which is behind turn the tables with a successful three-point goal?In other words, if the team which is behin

2021-01-27 06:57:49 236

原创 Codeforces Round #697 (Div. 3) 寒假训练题解

A. Odd DivisorYou are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x>1) that n is divisible by x and x is odd).For example, if n=6, then there is x=3. If n=4, then such a number does not exist.

2021-01-27 06:35:34 342

原创 Codeforces Round #696 (Div. 2) 寒假训练题解

A. Puzzle From the FutureIn the 2022 year, Mike found two binary integers a and b of length n (both of them are written only by digits 0 and 1) that can have leading zeroes. In order not to forget them, he wanted to construct integer d in the following wa

2021-01-27 06:02:07 177

原创 Educational Codeforces Round 102 (Rated for Div. 2) 寒假训练题解

A. Replacing ElementsIn one step you can choose three distinct indices i, j, and k (i≠j; i≠k; j≠k) and assign the sum of aj and ak to ai, i. e. make ai=aj+ak.Can you make all ai lower or equal to d using the operation above any number of times (possibly,

2021-01-27 05:58:36 216

原创 Codeforces Round #695 (Div. 2)寒假训练题解

A - Wizard of OrzThere are n digital panels placed in a straight line. Each panel can show any digit from 0 to 9. Initially, all panels show 0.Every second, the digit shown by each panel increases by 1. In other words, at the end of every second, a panel

2021-01-10 15:24:04 421

原创 Codeforces Round #694 (Div. 2) 寒假训练题解

A - Strange PartitionYou are given an array a of length n, and an integer x. You can perform the following operation as many times as you would like (possibly zero): replace two adjacent elements of the array by their sum. For example, if the initial arra

2021-01-10 15:19:32 497

原创 CF div.3 寒假训练题解

C. Long JumpsPolycarp found under the Christmas tree an array a of n elements and instructions for playing with it:At first, choose index i (1≤i≤n) — starting position in the array. Put the chip at the index i (on the value ai).While i≤n, add ai to your

2021-01-05 22:10:32 513 1

原创新生赛赛后总结

1. 蒲煜凡的约会题目描述蒲煜凡学长跟学妹出来约会了！蒲煜凡学长作为一名标准直男，想要给学妹买一杯奶茶，便问学妹喜欢喝什么样的奶茶，学妹回了两个字随便!蒲煜凡学长傻眼了，但作为一名优秀的ACMer，他是不会坐以待毙的，他早早便将学妹喜欢喝的奶茶价格和奶茶店的价格表弄到了手!现在你要根据奶茶价格，判断学妹到底喜欢喝哪一种奶茶，如果有多种奶茶价格都符合要求，输入种类靠前的一种输入描述:第一行包含一个整数n，表示有n种奶茶第二行有n个数字a[i]，a[i]表示第i种奶茶价格第三行包含一个整数Q，表

2020-12-08 00:37:22 207

qq_32639673的博客