期末考试_细胞自动机

package 面向对象程序设计_Java语言_翁恺;

import java.util.Scanner;

public class The_final_exam
{
	private int times;
	private int width;
	private int height;
	int old_field[][];
	int new_field[][];

	Scanner in = new Scanner(System.in);

	void Init()
	{
		width = in.nextInt();
		height = in.nextInt();
		old_field = new int[height+2][width+2];
		new_field = new int[height+2][width+2];
		
		// 初始化为0
		for (int i = 0; i < height+2; i++)
			for (int j = 0; j < width+2; j++)
			{
				old_field[i][j] = 0;
				old_field[i][j] = 0;
			}
		
		//读入活的细胞的位置
		while(true)
		{
			int i=in.nextInt();
			int j=in.nextInt();
			if(i==-1&&j==-1)
				break;
			old_field[i+1][j+1]=1;
			new_field[i+1][j+1]=1;
		}
		//读入执行步数
		times = in.nextInt();
	}

	void run()
	{
		for(int k=0;k<times;k++)
		{
			for(int i=1;i<height+1;i++)
			{
				for(int j=1;j<width+1;j++)
				{
					int count=getNeighbor(i, j);
					if(old_field[i][j]==0)
					{
						if(count==3)//细胞复活
							new_field[i][j]=1;
					}
					else
					{
						if(!(count==2||count==3))//细胞死亡
							new_field[i][j]=0;
					}
				}
			}
			//copy
			for (int i = 1; i < height+1; i++)
			{
				for (int j = 0; j < width+1; j++)
				{
					old_field[i][j] = new_field[i][j];
				}
			}
			
		}
	}
	
	int getNeighbor(int i,int j)
	{
		//计算位置为i，j的细胞周围活的细胞的数量
		int temp=0;
		temp+=old_field[i-1][j]+old_field[i+1][j]+old_field[i][j-1]+old_field[i][j+1];
		temp+=old_field[i-1][j-1]+old_field[i-1][j+1]+old_field[i+1][j-1]+old_field[i+1][j+1];
		return temp;
	}
	
	int Count()
	{
		//计算活着的细胞的数量
		int count=0;
		for (int i = 1; i < height+1; i++)
		{
			for (int j = 1; j < width+1; j++)
			{
				if(old_field[i][j]==1)
					count++;
			}
		}
		return count;
	}
	void Test()
	{
		Init();
		run();
		System.out.println(Count());
	}
	
	public static void main(String[] args)
	{
		// TODO Auto-generated method stub
		new The_final_exam().Test();
	}

}