#introheuristicsa. [intro_heuristics_a]AtCoder Contest Scheduling
[intro_heuristics_a]AtCoder Contest Scheduling
Problem Statement
AtCoder currently hosts three types of contests: ABC, ARC, and AGC. As the number of users has grown, in order to meet the needs of more users, AtCoder has decided to increase the number of contests to 26 types, from AAC to AZC. For convenience, we number these 26 types as type 1 through type 26. AtCoder wants to schedule contests for days so that user satisfaction is as high as possible. For every day, AtCoder will hold exactly one contest, and each contest will end on that day. The satisfaction is calculated as follows.
- The satisfaction at the beginning of day 1 is 0. Satisfaction can be negative.
- Holding contests increases satisfaction. The amount of increase will vary depending on a variety of factors. Specifically, we know in advance that holding a contest of type on day will increase the satisfaction by .
- If a particular type of contest is not held for a while, the satisfaction decreases. Each contest type has an integer , and at the end of each day , the satisfaction decreases as follows. Let be the last day before day (including ) on which a contest of type was held. If contests of type have never been held yet, we define . At the end of day , the satisfaction decreases by .
Please schedule contests on behalf of AtCoder. If the satisfaction at the end of day is , you will get a score of . There are 50 test cases, and the score of a submission is the total scores for each test case. You can make submissions multiple times, and the highest score among your submissions will be your score.
Constraints
- Each is an integer satisfying .
- Each is an integer satisfying .
Input
Input is given from Standard Input in the following format:
Output
Let () be the type of the contest that will be held at day . Print integers to Standard Output in the following format:
Any output that does not follow the above format may result in 0 pointsWA for that test case.
Input Generation
Each integer and is generated independently and uniformly at random from the integers in the range described in the problem statement.
Sample Input 1
Sample Output 1
Note that this example is a small one for checking the problem specification. It does not satisfy the constraint and is never actually given as a test case. The final satisfaction with this output is 79325, so the score is 1079325.
Input generator, score calculator, and visualizer
Beginner's Guide
If you don't know what to do, proceed to problem B or C.