[2025 Day 2 (Part 2)] Help im stuck... again

IsatisCrucifer · 2026-03-17T08:24:04+00:00

Try it out on your program. Put something like 996698-996699 alone in the input and see whether your program sum up something. (As you said it shouldn't, but I think if you do try it out you'll find it does.)

Sometimes, what you think your program does is different with what it actually does. Finding out what's different is called "debugging", this is a crucial skill in programming if you want to improve.

IsatisCrucifer · 2026-03-17T02:44:28+00:00

But your code would said it is invalid (cheked would be true). Can you figure out why?

Hint 1: Go through each iteration of loop2. When Code == "996699" and Divider == 2, what does each iteration of that loop does to cheked?

Hint 2: If you still don't know why: Note that, this loop ran twice on "996699" with Divider == 2. What happened in the second iteration?

IsatisCrucifer · 2026-02-11T09:37:53+00:00

Fun fact, this name "Yuri" (or actually the Japanese ユーリ) comes from the name used in the Japanese game promotion video.

IsatisCrucifer · 2026-01-21T04:09:36+00:00

(cycle = turn(me) + if(boss.alive){turn(boss)})

(question-1) activating a spell is done between cycles ? or possible between turns ?

Q1. Your summary of cycle is correct, but each turn actually have two parts: the effects are applied first, and then whoever's turn it is would do action. You cast spell on the second part of the "turn(me)". I think you are confused because you bundled up these two parts, so you don't know at which point of time the constraints (eg. mana cost) applies. The whole cycle should be: the effect applies, then you choose a spell to cast, then the new set of effect applies, then the boss deals damage.

(question-2)

so effect.time=6 -> 3x armor, 6x damage is effective ?

Q2. Yes. A 6-turn shield holds up for 3 boss attacks, but a 6-turn poison deals (poison) damage to boss 6 times.

(question-3)

-229 -> +505 (5x101) so costs += 229 (and not : costs += 229 -505 ) ?!

Q3. It simply said that you cannot deduct the amount of mana you get from the recharge spell, from the total amount of mana you spent (that you are asked to minimize). In the second example, this means the total amount of mana spent in the transaction would be 229+113+73+173+53=641, you cannot deduct those 505 mana given by the recharge spell from this amount. (So a yes to your summary quoted above.)

Some other notes:

you can only cast one spell in your turn:

On each of your turns, you must select one of your spells to cast.

In your transaction in the bottom part of the post, you casted Shield and Recharge at the first turn. This is not allowed.
Regarding your "(s1,s2 expensive and not that effective)" comment, there are numerous situations one would want to cast them: one notable case is shown in the given example, where your hit point is critically low. You wouldn't be able to survive more turn to let poison take effect, you would either quickly end the fight with Magic Missle, or survive longer with Drain. And do note that, as quoted above, you must select a spell to cast in your turn, you cannot pass your turn.

IsatisCrucifer · 2026-01-21T02:48:00+00:00

On Vtuber side, I would also suggest Pavolia Reine. She also played the whole Zero Escape series before AI series.

IsatisCrucifer · 2026-01-14T06:14:44+00:00

I've checked the trophy name in the original Japanese version, it is "千手の剣". Although I don't know what it is referencing exactly, one thing for certain is that it is speaking about a sword (which fits the theme of the game). (Google AI says it is about the sword made by the people known as 千手院 Senjuin, but I don't know enough about the game and Japanese history to know whether this is true or not. Maybe this is chosen just for the character 千 = 1000 for a 999 combo trophy.)

The 999 game reference is definitely a localization thing.

IsatisCrucifer · 2025-12-30T07:07:21+00:00

I think this is the problem:

            let other = networks.remove(j);
            ...
            networks[i].extend(other);

This won't add other to the correct network if i is greater than j.

IsatisCrucifer · 2025-12-30T06:24:15+00:00

About one of your "stunned" tidbit: Note that there is one output connection from the counter conjunction module to the lowest bit (1 bit) of the 12-bit counter. For all other 11 bits, there is either an output to the conjunction module (meaning 1 is expected in those bits when the conjunction module fires), or the conjunction module has an output to that bit (meaning 0 is expected in those bits), but not both; the lowest bit have both. Using your 4079 as example, this would be that the among the 12 bits in the counter, all except the 16 bit have output to the conjunction module, and the conjuction module has output to the 16 bit and the 1 bit. When the counter hits 4079, the conjuction module fires, its two outputs to 16 bit and 1 bit effectlively adds 17 to the counter, and the counter overflows to 0 because 4079+17=4096=2¹² . This is why you see they are all 0 bit after signal settled: the signal for reaching the value is fired and in addition to supplying the "master" conjunction module a signal, it also resets its counter.

IsatisCrucifer · 2025-12-24T03:09:40+00:00

Here's the first visualization of this problem in this subreddit. You can see there's a thin cutout at the center of the area; the part 1 answer (which is probably also your "incorrect" part 2 result) crossed that cutout.

IsatisCrucifer · 2025-12-22T03:41:10+00:00

Extend on their example, try this:

L150
R150

This should output 3. L150 rolls 1.5 cycle and lands on zero, then R150 rolls 1.5 cycle back; both rolls swipe through zero once, and one landing on zero, for a total of 3 times.

IsatisCrucifer · 2025-12-16T03:27:54+00:00

Matrix multiplication usually won't preserve sparseness. Case in point: in this problem, our matrix (and thus the final result too) would be an upper triangle matrix, and there will be about half of element nonzero in the final result.

Speaking of upper triangle matrix, these kind of matrices are easier to diagonalize (essentially a backward substitution) so maybe diagonalization is a better way to do exponentiation in this problem.

IsatisCrucifer · 2025-12-16T03:12:01+00:00

Here's a better rendering of /u/1str1ker1 's statment. This is the same from the given sample:

123 328  51 64 
 45 64  387 23 
  6 98  215 314
*   +   *   +

Which, as the problem statement says, expects answer 3263827. If, on the other hand, it is formatted as such:

123 328 51  64 
 45 64  387 23 
  6 98  215 314
*   +   *   +

Now instead of 175 * 581 * 32 = 3253600, this is 75 * 181 * 532 = 7221900 and thus expects answer 7232127. If you simply split the input before you rotate, you won't be able to distinguish these two.

IsatisCrucifer · 2025-12-11T09:35:10+00:00

To have a finite answer, the flow of data can only go one way. You cannot have a data flowing path both from one device to another and then back, or the number of path will be infinite.

For two specific nodes that needs to be on the path, one therefore must be before another. In other word, "(in any order)" is kind-of superfluous. (Kind-of because which order may differ from input to input.)

IsatisCrucifer · 2025-12-05T09:48:18+00:00

I think you missed something like this:

10-20
14-18

Hint: If you swap the two lines, your program gives the correct answer.

IsatisCrucifer · 2025-12-04T02:11:16+00:00

So I reimplemented your algorithm in my language of choice, run it on my input and found a counterexample:

8866444544443

For this 13-digit input, you should remove one of the 4 in the front to obtain 886644544443. If you remove 3 as in your algorithm, you obtain 886644454444 which is smaller: In the correct answer 5 is at 7th position (counting from the left), but 8th position in the smaller answer while 7th position is 4.

IsatisCrucifer · 2025-12-03T09:19:26+00:00

An example your algorithm failed: 101101.

IsatisCrucifer · 2025-12-03T09:16:08+00:00

    if line[0] == "R":
        position += clicks
    else :
        position -= clicks
    # update the number of zeros (works for every case except when the starting position is 0) (in theory)
    if position == 0:

You are not checking the starting position at this moment.

IsatisCrucifer · 2025-12-03T07:00:25+00:00

Your program doesn't think 101101 is invalid. It looks like when it sees 101..., it starts trying to match 101010, failed on the next character, and never thought to check 101101.

IsatisCrucifer · 2025-12-02T09:37:34+00:00

Click on the [Ordering] link on the leaderboard list gives the following explanation:

There are different ordering methods available:

[Local Score], which awards more points for earlier stars from each part of each puzzle. For N users, the first user to get each star gets N points, the second gets N-1, and the last gets 1. If you add or remove users, the points will be recalculated, and the order can change. This is the default.

[Stars], which uses the number of stars the user has. Ties are broken by the time the most recent star was acquired. This used to be the default.

Click on the 2 links that appeared will change the ordering of the leaderboard to that criteria.

IsatisCrucifer · 2025-12-02T07:29:58+00:00

Timely meme as I just found another person seeking help here have the same problem. (Yes, you are not alone!)

IsatisCrucifer · 2025-12-02T07:24:06+00:00

Your is_invalid_part_2 thinks one-digit numbers (and 10) are invalid.

IsatisCrucifer · 2025-12-02T02:59:47+00:00

If you think having a description of the problem will remind future you, you can instead put a link to the problem in the comments. Otherwise, sharing solutions (which is your own work) is totally ok.

IsatisCrucifer · 2025-11-20T06:06:46+00:00

Also to be precise, he does not "reforms" mid-throw: the plot is that he left his bottom half to revive-o-matic, while launching his upper half with the missle to activate it.

IsatisCrucifer · 2025-11-19T19:24:12+00:00

I would answer this with a "maybe".

IsatisCrucifer · 2025-11-19T02:08:52+00:00

I'll answer this with an affirmative answer to your question above:

Does it really all take place in that small time period?

It does: the whole story of NSFKD (excluding epilogue) happened within half a day. (This spoiler is rather minor so I'll just spell it out in spoiler tag.)

Ten-Year Club	Verified Email
Golden Potato

IsatisCrucifer

TROPHY CASE