qq_45891413的博客

During their New Year holidays, Alice and Bob play the following game using an array a of n integers:Players take turns, Alice moves first.Each turn a player chooses any element and removes it from the array.If Alice chooses even value, then she adds it

Polycarp 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 score and mov

Alice and Bob received n candies from their parents. Each candy weighs either 1 gram or 2 grams. Now they want to divide all candies among themselves fairly so that the total weight of Alice’s candies is equal to the total weight of Bob’s candies.Check if

or the New Year, Polycarp decided to send postcards to all his n friends. He wants to make postcards with his own hands. For this purpose, he has a sheet of paper of size w×h, which can be cut into pieces.Polycarp can cut any sheet of paper w×h that he ha

You’ve probably heard about the twelve labors of Heracles, but do you have any idea about the thirteenth? It is commonly assumed it took him a dozen years to complete the twelve feats, so on average, a year to accomplish every one of them. As time flows fa

After his wife’s tragic death, Eurydice, Orpheus descended to the realm of death to see her. Reaching its gates was uneasy, but passing through them proved to be even more challenging. Mostly because of Cerberus, the three-headed hound of Hades.Orpheus, a

Athenaeus has just finished creating his latest musical composition and will present it tomorrow to the people of Athens. Unfortunately, the melody is rather dull and highly likely won’t be met with a warm reception.His song consists of n notes, which we

Argus was charged with guarding Io, which is not an ordinary cow. Io is quite an explorer, and she wanders off rather frequently, making Argus’ life stressful. So the cowherd decided to construct an enclosed pasture for Io.There are n trees growing along

We call a positive integer number fair if it is divisible by each of its nonzero digits. For example, 102 is fair (because it is divisible by 1 and 2), but 282 is not, because it isn’t divisible by 8. Given a positive integer n. Find the minimum integer x,

You have been assigned to develop a filter for bad messages in the in-game chat. A message is a string S of length n, consisting of lowercase English letters and characters ‘)’. The message is bad if the number of characters ‘)’ at the end of the string st

A robot is standing at the origin of the infinite two-dimensional plane. Each second the robot moves exactly 1 meter in one of the four cardinal directions: north, south, west, and east. For the first step the robot can choose any of the four directions, b

There are n cards numbered 1,…,n. The card i has a red digit ri and a blue digit bi written on it.We arrange all n cards in random order from left to right, with all permutations of 1,…,n having the same probability. We then read all red digits on the car

B. Find The Arraytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array [a1,a2,…,an] such that 1≤ai≤109. Let S be the sum of all elements of the array a.Let’s call an array b of n

You are playing a new computer game in which you have to fight monsters. In a dungeon you are trying to clear, you met three monsters; the first of them has a health points, the second has b health points, and the third has c.To kill the monsters, you can

outputstandard outputThis is the hard version of this problem. The only difference between the easy and hard versions is the constraints on k and m. In this version of the problem, you need to output the answer by modulo 109+7.You are given a sequence a

This is the easy version of this problem. The only difference between easy and hard versions is the constraints on k and m (in this version k=2 and m=3). Also, in this version of the problem, you DON’T NEED to output the answer by modulo.You are given a s

outputstandard outputPolycarp was given an array of a[1…n] of n integers. He can perform the following operation with the array a no more than n times:Polycarp selects the index i and adds the value ai to one of his choice of its neighbors. More formally

You are given a positive number x. Find the smallest positive integer number that has the sum of digits equal to x and all digits are distinct (unique).InputThe first line contains a single positive integer t (1≤t≤50) — the number of test cases in the te

Polycarp has a string s[1…n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 time):Polycarp selects two numbers i and j (1≤i≤j≤n) and removes cha

Polycarp has a favorite sequence a[1…n] consisting of n integers. He wrote it out on the whiteboard as follows:he wrote the number a1 to the left side (at the beginning of the whiteboard);he wrote the number a2 to the right side (at the end of the whiteb

You have n distinct points (x1,y1),…,(xn,yn) on the plane and a non-negative integer parameter k. Each point is a microscopic steel ball and k is the attract power of a ball when it’s charged. The attract power is the same for all balls.In one operation,

A string b is a subsequence of a string a if b can be obtained from a by deletion of several (possibly, zero or all) characters. For example, “xy” is a subsequence of “xzyw” and “xy”, but not “yx”.You are given a string a. Your task is to reorder the char

You are given an integer n (n>1).Your task is to find a sequence of integers a1,a2,…,ak such that:each ai is strictly greater than 1;a1⋅a2⋅…⋅ak=n (i. e. the product of this sequence is n);ai+1 is divisible by ai for each i from 1 to k−1;k is the ma

You are given a sequence a, initially consisting of n integers.You want to transform this sequence so that all elements in it are equal (i. e. it contains several occurrences of the same element).To achieve this, you choose some integer x that occurs at

There is a game called “Unique Bid Auction”. You can read more about it here: https://en.wikipedia.org/wiki/Unique_bid_auction (though you don’t have to do it to solve this problem).Let’s simplify this game a bit. Formally, there are n participants, the i

You are given one integer n (n>1).Recall that a permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation of length 5, but [1,2,2] is not a permutation (2 appears twi

Utkarsh is forced to play yet another one of Ashish’s games. The game progresses turn by turn and as usual, Ashish moves first.Consider the 2D plane. There is a token which is initially at (0,0). In one move a player must increase either the x coordinate

Ashish has two strings a and b, each of length n, and an integer k. The strings only contain lowercase English letters.He wants to convert string a into string b by performing some (possibly zero) operations on a.In one move, he can eitherchoose an inde

Hr0d1y has q queries on a binary string s of length n. A binary string is a string containing only characters ‘0’ and ‘1’.A query is described by a pair of integers li, ri (1≤li<ri≤n).For each query, he has to determine whether there exists a good sub

Ridbit starts with an integer n.In one move, he can perform one of the following operations:divide n by one of its proper divisors, orsubtract 1 from n if n is greater than 1.A proper divisor is a divisor of a number, excluding itself. For example, 1,

There are n+2 towns located on a coordinate line, numbered from 0 to n+1. The i-th town is located at the point i.You build a radio tower in each of the towns 1,2,…,n with probability 12 (these events are independent). After that, you want to set the sign

You are given a string s, consisting of brackets of two types: ‘(’, ‘)’, ‘[’ and ‘]’.A string is called a regular bracket sequence (RBS) if it’s of one of the following types:empty string;‘(’ + RBS + ‘)’;‘[’ + RBS + ‘]’;RBS + RBS.where plus is a conc

You are asked to watch your nephew who likes to play with toy blocks in a strange way.He has n boxes and the i-th box has ai blocks. His game consists of two steps:he chooses an arbitrary box i;he tries to move all blocks from the i-th box to other boxe

There is an infinite 2-dimensional grid. The robot stands in cell (0,0) and wants to reach cell (x,y). Here is a list of possible commands the robot can execute:move north from cell (i,j) to (i,j+1);move east from cell (i,j) to (i+1,j);move south from c

This is the easy version of the problem. The difference between the versions is in the number of possible operations that can be made. You can make hacks if and only if you solved both versions of the problem.You are given a binary table of size n×m. This

A median of an array of integers of length n is the number standing on the ⌈n2⌉ (rounding up) position in the non-decreasing ordering of its elements. Positions are numbered starting with 1. For example, a median of the array [2,6,4,1,3,5] is equal to 3. T

You are given four integers n, c0, c1 and h and a binary string s of length n.A binary string is a string consisting of characters 0 and 1.You can change any character of the string s (the string should be still binary after the change). You should pay h

You are given two strings A and B representing essays of two students who are suspected cheaters. For any two strings C, D we define their similarity score S(C,D) as 4⋅LCS(C,D)−|C|−|D|, where LCS(C,D) denotes the length of the Longest Common Subsequence of

You have a knapsack with the capacity of W. There are also n items, the i-th one has weight wi.You want to put some of these items into the knapsack in such a way that their total weight C is at least half of its size, but (obviously) does not exceed it.

You are given a rectangular grid with n rows and m columns. The cell located on the i-th row from the top and the j-th column from the left has a value aij written in it.You can perform the following operation any number of times (possibly zero):Choose a