8100번 - Containers 다국어

We are given n containers, where 1 ≤ n ≤ 4. At the beginning all of them are full of water. The liter capacity of the i-th container is a natural number o_i satisfying inequalities 1 ≤ o_i ≤ 49.

Three kinds of moves can be made:

• Pouring the whole content of one container into another. This move can be made unless there is too little room in the second container.
• Filling up one container with part of the water from another one.
• Pouring away the whole content of one container into a drain.

Write a program that:

• reads form the standard input the number of containers n, the capacity of each container and the requested final amount of water in each container,
• verifies, whether there exist a series of moves which leads to the requested final situation, and if there is one, the program computes the minimal number of moves leading to the requested situation,
• writes the result into the standard output. The result should be the minimal number of moves leading to the requested final situation, or one word NIE (“no” in Polish) if there is no such a sequence of moves.

In the first line of the standard input one positive integer n is written (n ≤ 4), this is the number of containers. There are n positive integers written in the second line. These are the capacities of the containers (the i-th integer o_i denotes the capacity if the i-th container, 1 ≤ o_i ≤ 49). In the third line of the input file there are written n numbers. These are the requested final volumes of water in the containers (the i-th integer w_i denotes the requested final volume of water in the i-th container, 1 ≤ w_i ≤ o_i). All integers in the second and the third line are separated by single spaces.

If it is not possible to result in requested final situation making only allowed moves, your program should write only one word NIE to the standard output, otherwise only one integer equal to the minimal number of moves which lead to the requested final situation should be written.