问题：有编号为1，2，...，n的n个小球，将其装人编号为1，2，...，n的n个盘中，每盒装1个球，且球与盒的编号不同，问不同的装球方法有多少种．邓廷元老师在文[1]中给出了这类“一对一错号排列”问题的公式解法该公式是用排除法得到的，并且文[1]中指出，n的值增大后，仍用常规 Question: There are n balls numbered 1,2,...,n, which are loaded into n disks numbered 1,2,...,n, one ball per box, and the ball Different from the box number, ask how many different ball loading methods. In the paper [1], Professor Deng Tingyuan gives a formulaic solution to this type of “one-to-one wrong numbering” problem. This formula is derived using the elimination method, and in [1] it is pointed out that the value of n increases. Still using conventional