As said in description:

A team can know the bonus amount of its adjacent team, if the
score of the adjacent team is lower than itself.

This means the first team (team who scored 30) will know the bonus amount of the second team (team who scored 20), the second team will know the amount of bonus from the third team (team who scored 10). Also said in description that:

If a team finds that its bonus is no higher than the adjacent team whose
score is lower than itself, the team will not be satisfied

First we know that the third team knew none of the other teams' score, therefore they get the lowest of 1 bonus. Secondly, the second team knew the score of third team (which means second team have a higher amount of score), therefore they needed a bonus amount higher than 1, which is 2. We can also use the same logic to get the amount of bonus for the first team, they needed a bonus higher than 2, which is 3. Then we add all the bonuses together to get:

1+2+3=6k, so the answer is 6 for minimum bonus. Sorry if my explaination isn't clear enough :)

great kata!

Thanks @cod3abuser! But technically it's not a good solution hahaha

Thanks for the nice kata!

Hi, this is a very fun kata but there is something that is unclear to me in the description. You said:

The number inside the bracket will always be greater than 1.

But there are test cases where the number inside the bracket is equal to 1, mind changing it to greater or equal to 1? Many thanks.

Nice kata, but why is it named 'Rectangle' Cipher Puzzle?

Nice kata!

I thought it's full metal alchemist... haha

Nice kata

A weird kata... hahaha

Nice kata !!!

Thanks for approval ! :)

I have to say the edge conditions are so freaking annoying hahaha. Nice kata.