2013
11-12

# Block game with the Little Prince

The Little Prince, who lives in the B-615 planet, sometimes enjoys a game to pile up blocks. He has N identical blocks and a box with K rooms for M blocks at most. That is, he can pile up M blocks, at most, into one of the K rooms, but can’t more than M blocks. For example, if N = 3, K = 3, M = 2, there are seven ways to pile up all blocks:

Given two states of blocks, He wants to know how many times he should move blocks one by one, to change the initial state into the final state. For instance, he can choose one block from any of 3 rooms (A, B, C), and then move it into another room. Of course, he cannot put more than M blocks at the room.

First line has three positives integers, N (1 ≤ N ≤ 30), M (1 ≤ M ≤ 4), and K (1 ≤ K ≤ 10). Each of next K lines contains the number of blocks piled at the room. This represents the initial state. Likely, another K lines are given, and this indicates the final state that the Little Prince want to make. Input is always valid.

Output the minimal number of moves necessary to make the final state.

3 2 3
1
1
1
2
0
1

1

//* @author 洪晓鹏<hongxp11@163.com>
import java.util.Scanner;

public class Main {
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int m = in.nextInt();
int k = in.nextInt();
int[] initial= new int[k];
int[] finish = new int[k];
for(int i = 0; i< k; i++)
{
initial[i] = in.nextInt();
}
for(int i = 0; i< k; i++)
{
finish[i] = in.nextInt();
}
int sum = 0;
for(int i = 0; i< k; i++)
{
int l = finish[i] - initial[i];
if(l>0)
sum += l;
}
System.out.println(sum);
}
}

1. 站长，你好！
你创办的的网站非常好，为我们学习算法练习编程提供了一个很好的平台，我想给你提个小建议，就是要能把每道题目的难度标出来就好了，这样我们学习起来会有一个循序渐进的过程！