codeforces
文章平均质量分 71
Excers
这个作者很懒,什么都没留下…
展开
-
codeforces B. Odd Grasshopper
B. Odd GrasshopperThe grasshopper is located on the numeric axis at the point withcoordinate x0.Having nothing else to do he starts jumping between integer points onthe axis. Making a jump from a point with coordinate x with a distanced to the left m原创 2021-11-12 17:58:37 · 295 阅读 · 0 评论 -
codeforces 1607D.Blue-Red Permutation
D. Blue-Red PermutationYou are given an array of integers a of length n. The elements of thearray can be either different or the same.Each element of the array is colored either blue or red. There are nounpainted elements in the array. One of the two原创 2021-11-12 17:36:20 · 220 阅读 · 0 评论 -
codeforces1575j
J. Jeopardy of Dropped Ballshttps://codeforces.com/problemset/problem/1575/JMr. Chanek has a new game called Dropping Balls. Initially, Mr. Chanekhas a grid a of size n×m Each cell (x,y) contains an integer ax,ydenoting the direction of how the ball w原创 2021-11-11 11:02:55 · 120 阅读 · 0 评论 -
codeforces 1555A
A. PizzaForcesPizzaForces is Petya’s favorite pizzeria. PizzaForces makes and sellspizzas of three sizes: small pizzas consist of 6 slices, medium onesconsist of 8 slices, and large pizzas consist of 10 slices each.Baking them takes 15, 20 and 25 minu原创 2021-11-11 10:54:17 · 140 阅读 · 0 评论 -
codeforces 1554A
A. CherryYou are given n integers a1,a2,…,an. Find the maximum value of max(al,al+1,…,ar)⋅min(al,al+1,…,ar) over all pairs (l,r) of integers for which 1≤l<r≤n.Input The first line contains a single integer t (1≤t≤10000) — thenumber of test cases.T原创 2021-11-11 10:40:25 · 91 阅读 · 0 评论 -
codeforces 1553A
A. Digits SumLet’s define S(x) to be the sum of digits of number x written in decimal system. For example, S(5)=5, S(10)=1, S(322)=7.We will call an integer x interesting if S(x+1)<S(x). In each test youwill be given one integer n. Your task is to c原创 2021-11-11 10:23:15 · 123 阅读 · 0 评论 -
codeforces 1554D
D. Diane D. DianeYou are given an integer n. Find any string s of length n consistingonly of English lowercase letters such that each non-empty substringof s occurs in s an odd number of times. If there are multiple suchstrings, output any. I原创 2021-11-11 10:14:00 · 78 阅读 · 0 评论