AtCoder Beginner Contest 151 Thank you for your hard work! Official page
The code I wrote this time is here I will explain briefly below.
Problem printing the next alphabet of the input string. I knew that the char of java would be the next char when incremented, so I wrote it as it is.
The question is how many points should be given to reach the target point given the test points. All you have to do is add the test scores in order and subtract from the target score.
Please note that you may not be able to reach the target point even if you try hard, or you may have already reached it.
I personally had a little bone.
A question that counts the number of correct questions and the number of penalties given the question number and ʻAC
Note that the penalty number applies only to the correct question. (This was once incorrect.)
The problem of selecting a specific number from a combination of numbers and adding the difference between the maximum and minimum values by the number of combinations. It was TLE without the idea of finding the maximum and minimum values separately.
After the contest, I changed to ask for the maximum value and the minimum value separately, but I gave up because I entered the labyrinth as WA without TLE being fixed. I learned that there is an idea to find the maximum value and the minimum value separately, so I'm going to say Yoshi. (I wonder if the calculation method of the binomial coefficient is slow ...)
(Added on 2020/01/16) I got advice in the comment section, corrected it and became AC!
The problem is to find the radius of the smallest circle that contains a certain number of points. I halved the maximum length of all points, but that wasn't enough consideration.
Since the number of points was 50, I should have noticed that the amount of calculation could be expanded a little ... sorry.
Unfortunately, the rating has dropped for the first time this time. Up until now, I've been trying with a round waist, but I'm thinking of starting to learn theory little by little. ..