一维元胞自动机的实现。假定一维元胞自动机的其中某个规则，时空图L=100，初值取Xi0=1(i=50) Xi0=0(i≠50)用白色表示0状态，用黑色表示1状态。 对给定规则，演化100时间步的C语言实现(Realization of One Dimensional Cellular Automata. Suppose one of the rules of a one-dimensional cellular automata, the space-time map L = 100. The 0 state is represented in white and the 1 state is shown in black. For a given rule, evolve 100 time steps in C language)