Hello everyone! Hope you enjoyed our contest, this was our first time making a contest in this fashion. Hopefully we will have many more years :)

Author: blueberryJam

**Solution**

The answer is `No`

. We would also accept the full CAPTCHA,

for those who have the patience to type it out.

Author: sg2themax

**Solution**

Simple dad joke: anything containing "codeforces gym" works as a valid output (including the URL, or just the phrase).

Author: zekigurbuz

**Solution**

The key observation is that when a submission receives a "wrong answer" verdict, the test case it fails on is the next correct digit of the passcode. After observing this, one may simply submit five times to learn the entire passcode, after which the problem is solved.

Author: B-1168

**Solution**

One may use a simple script to parse the list of companies — then, it will be trivial to identify from the sample that the "ranking" used is in fact the increasing alphabetical order of the name of these companies, which allows for a solution to be implemented with relative ease.

Sorry for including duplicate companies in the pastebin, we only noticed near the end of the contest :(

Author: porkchops

**Solution**

The fishy frequency constant is $$$4$$$. There are a few ways you could have arrived at this answer:

- Observe that 'fishy15' appears $$$4$$$ times in the blog post.
- Observe that 'fishy' appears $$$4$$$ times throughout the problem (once in the title, twice in the statement body, and once in the output instructions).
- Do the math. If you did the math, you should get that $$$a = e$$$ and $$$b = \pi$$$, so $$$h = \lfloor \sqrt{a^2 + b^2} \rfloor = \lfloor \sqrt{e^2 + \pi^2} \rfloor = 4$$$.

Author: fishy15

**Solution**

If you just submit to the problem once, it tells you the intended answer. This is hinted since the problem judge knows the answer (i.e. they are who knows), and "favoring the bold" suggests that people who submit even without knowing the answer might get some information.

Author: sg2themax

**Solution**

You may notice the input output examples align with strings in the announcement text for the contest from the Discord. The solution is to (after removing emojis and extra spaces from the announcement text), output the following word in the sequence.

Author: mwen

**Solution**

The problem hints at an off-by-one error. Indeed, it turns out the modulus was off by one zero (the code mods by $$$10^8+7$$$ instead of $$$10^9+7$$$). With the bug found, now a test case needs to be constructed to expose it. Essentially, we need a test case that has at least $$$10^8+7$$$ longest increasing subsequences. The given bounds are pretty tight, but something like 0 0 0 1 1 1 2 2 2...16 16 16 will give $$$3^{17} = 129140163$$$ longest increasing sequences, which works.

Author: DylanSmith

**Solution**

Notice that $$$\wedge$$$ is an XOR operator in this problem, not an exponent, so the maximum value of $$$n$$$ is $$$9$$$, and the maximum value of $$$v_i$$$ is $$$27$$$. Then, you can iterate over all possible paths to find the maximum valued-one.

Author: speedycatfish

Editorial: mwen

**Solution**

Just keep rolling with different seeds, and you will eventually pull Hitagi Senjougahara. There is about a 5.1% chance you get it every 10 pulls, so in expectation you only need 19.5 submissions to win. Fun fact: the lowest seed that works is 63.

Author: mwen

**Solution**

To solve this, print the name of your favorite problem. Thanks for participating and voting!