AtCoder-5633 Counting of Trees
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.
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.
If you have three numbers 1, 2, 3 and want the length of the consecutive subsequence be two, the answer is 3-2+1, because you can choose 1, 2 or 1, 3.
The pre-knowledges you should know is priority of operator. Priority is the rule that determines when we meet two operators, which to calculate first. Like 3+2*5, we calculate 2 * 5 first.
The priority of operators are:
Because of selecting the same character is allowed, so the probability of one character is
There is a fuzzy point in the description. That is all the car has to wait the same amount of time. For example,