Positions I and j are chosen by the robot (researchers can't handle it). He will apply this activity while p isn't a character stage. We can show that the robot will make close to n activities paying little heed to the decision of I and j on every activity. Researchers requested that you discover the most
Correct answer will be upvoted else downvoted. Computer science.
Positions I and j are chosen by the robot (researchers can't handle it). He will apply this activity while p isn't a character stage. We can show that the robot will make close to n activities paying little heed to the decision of I and j on every activity.
Researchers requested that you discover the most extreme conceivable time it will take the robot to get done with making p a character stage (I. e. most dire outcome imaginable), so they can conclude whether they should build another lunar meanderer or simply rest and pause. They will have a hard time believing you without evidence, so you should fabricate an illustration of p and robot's activities that amplifies the appropriate response.
For a superior comprehension of the assertion, read the example depiction.
Input
The principal line of input contains a solitary integer t (1≤t≤104) — the number of experiments.
Each of next t lines contains the single integer n (2≤n≤105) – the length of p.
Note, that p isn't given to you. You should figure out the greatest conceivable time over all changes of length n.
It is ensured, that the complete amount of n over all experiments doesn't surpass 105.
Output
For each experiment in the principal line, print how long will the robot spend in the most pessimistic scenario.
In the following line, print the underlying worth of p that you used to build a reply.
In the following line, print the number of activities m≤n that the robot makes in your model.
Step by step
Solved in 4 steps with 1 images
