CodeForces-1180A Alex and a Rhombus
This problem has a regular formula. First you count the outermost layer has how many squares. Then the second outermost layer. Until the second smallest layer.
This problem has a regular formula. First you count the outermost layer has how many squares. Then the second outermost layer. Until the second smallest layer.
The algorithm of the problem is BFS or DFS. I use BFS. Traverse all the points by layer and count it's alongside cats.
The answer of the problem has a regular pattern. For example, there is a sequence A and for number An in A, the number that is bigger than An has two parts
This is an overview of the knowledges in chapter 1.
At first I didn't understand the meaning of the problem. It means 1 is the root and the distance between the points on the first layer with the root is 1.
This is to find how many strings that starts with A and ends with B and the number of AB inside the string.
The max number = max(max number, answer).
The main mission of this problem is to count each players number of right questions.
Seeing the operation, we can easily think of Euclidean algorithm which is the way to calculate GCD.
The biggest answer is that after the operation the number can remain it self.