立体粒子动画特效

EXCEL精灵 反编译原代码 ，这段代码幸亏不是全球数据，要不会把编译器气冒烟的(EXCEL Wizard Decompiles Original Code)

说明：  问道SF最新版本的坐骑，变色凤凰，弄了好多种颜色，微变服务器直接用，原版的话，需要修改下坐骑能力，非常简单(Ask SF about the latest version of the mount, discolored Phoenix, made a variety of colors, slightly change the server to use directly, the original version, need to modify the mount ability, very simple.)

布谷鸟基本算法代码，可以下载后进行相关改进使用(Basic algorithm code for Cuckoo.It can be downloaded for related improvements.)

vb做的计算器，可以运行 vb做的计算器，可以运行-vb do calculators, can run vb do calculators, can run

说明：  这是多材料拓扑优化的matlab原代码，使极好的学习资源(This is the original matlab code for multi-material topology optimization, making excellent learning resources)

利用matlab仿真光子晶体光纤的模型横截面图。(The use of matlab simulation model of photonic crystal fiber cross-section.)

在不同供电区域负荷密度和不同变电所容量条件下 ,对中压配电网常见的几种接线模式进行了经济性和可靠性计算分析 ,研究其随负荷密度和变电所容量变化的趋势 ,以及在相同条件下不同接线模式之间的比较。(Under the conditions of load density and different substation capacity in different power supply areas, the economic and reliability calculations of several common wiring modes of medium voltage distribution network are carried out, and the trend of load density and capacity change of substation is studied. And a comparison between different wiring modes under the same conditions.)

说明：  路径规划问题，从起始地点到终点有多条路径，用来确定最短路径(In path planning, there are multiple paths from the starting point to the end point to determine the shortest path)

本题编写程序模拟人进行连连看游戏，电脑模拟人玩连连看的过程如下： 1、分析本局游戏，将本局游戏转化成一个二位数组。0表示空白区域，数字表示该游戏牌为出现在游戏中的第几类游戏牌。 2、利用广度优先搜索算法，判断两个游戏牌是否可以消除。 3、程序模拟人点击可以消除的一对游戏牌进行消除。 对某局游戏转化成二维数组如下： 0 0 0 0 0 0 1 2 0 0 0 0 3 4 0 0 0 0 1 0 输入二位数组的行、列，二位数组、起始元素的的坐标、终止元素的坐标，判断起始游戏牌和终止游戏牌是否可以消除。 对上例输入 4 5 0 0 0 0 0 0 1 2 0 0 0 0 3 4 0 0 0 0 1 0 1 1 3 3 输出 TRUE(The writing program simulates the game, and the computer simulates the process of watching the game as follows: 1. Analyze the game and convert the game into a two - bit array. 0 is the blank area, the number indicates that the game card is the number of game cards that appear in the game. 2. Use the breadth first search algorithm to judge whether the two game cards can be eliminated. 3, the program simulates a pair of game cards that can be eliminated by clicking. A game of a game is transformed into a two-dimensional array as follows: 00000 01200 00340 00010 Input the row and column of the two bit array, the coordinates of two bit array, the initial element, and the coordinates of the termination elements, so as to determine whether the initial game card and the ending game card can be eliminated. For example input 45 0000001200 0034000010 11 33 Output TRUE)

This vision couldn t support Chinese characters,which will be improved in next vision.