Здравейте,

Опитвам се да реша следната задача:

First, you will be given a sequence of integers representing firework effects. Afterwards you will be given another sequence of integers representing explosive power.

You need to start from the first firework effect and try to mix it with the last explosive power. If the sum of their values is:

1. divisible by 3, but it is not divisible by 5 – create Palm firework and remove both materials
2. divisible by 5, but it is not divisible by 3 – create Willow firework and remove both materials
3. divisible by both 3 and 5 – create Crossette firework and remove both materials

Otherwise, decrease the value of the firework effect by 1 and move it at the end of the sequence. Then, try to mix the same explosive power with the next firework effect.

If any value is equal to or below 0, you should remove it from the sequence before trying to mix it with the other.

When you have successfully prepared enough fireworks for the show or you have no more firework punches or explosive power, you need to stop mixing.

To make the perfect firework show, Maria needs 3 of each of the firework types.

Input

1. On the first line, you will receive the integers representing the firework effects, separated by ", ".
2. On the second line, you will receive the integers representing the explosive power, separated by ", ".

Output

1. On the first line, print:
   • if Maria successfully prepared the firework show: "Congrats! You made the perfect firework show!"
   • if Maria failed to prepare it: "Sorry. You can't make the perfect firework show."
2. On the second line, print all firework effects left if there are any:

• Firework Effects left: {effect1}, {effect2}, (…)"

1. On the third line, print all explosive fillings left if there are any:

•  Explosive Power left: {filling1}, {filling2}, (…)"

1. , you need to print all fireworks and the amount you have of them:
   • "Palm Fireworks: {count}"
   • "Willow Fireworks: {count}"
   • "Crossette Fireworks: {count}"

Constraints

1. All the given numbers will be integers in the range [-100, 100].
2. There will be no cases with empty sequences.

Examples

Judge ми дава 60/100. Знам, че задачата я има решена вече, но ме интересува къде е грешката в моя код и начин на решаване на задачата. Предположението ми е, че нещо се омазва когато попвам и апендвам.

Pastebin: https://pastebin.com/kX8Ax5iN

Благодаря предварително.