变化的阵线，永恒的鲜花

好玩的

#include<bits/stdc++.h>
using namespace std;
int a[5][5],scor,bi_scor,way;
void fir(){
	for (int i = 0; i < 16;i++)
		a[i/4+1][i%4+1]=0;
	if (scor > bi_scor){
		printf("破纪录!\n新高分:%d\n",scor);
		bi_scor=scor;
	}
	scor=2;
} 
void whi(){
	for (int i = 1;i <= 4;i++){
		for (int j = 1;j <= 4;j++)
			cout<<a[i][j]<<' ';
		cout<<endl;
	}
	cout<<"当前得分:"<<scor<<endl;
	cin>>way;
	if (way==6){
		for (int j = 1;j < 4;j++){
			for (int i = 1;i <= 4;i++){
				if (a[i][j]!=0){
					if (a[i][j+1]==0){
						a[i][j+1]=a[i][j];
						a[i][j]=0;
					}
					if (a[i][j+1]==a[i][j]){
						a[i][j+1]+=a[i][j];
						a[i][j]=0;
					}
				}
			}
		}
	}
	if (way==2){
		for (int i = 1;i < 4;i++){
			for (int j = 1;j <= 4;j++){
				if (a[i][j]!=0){
					if (a[i+1][j]==0){
						a[i+1][j]=a[i][j];
						a[i][j]=0;
					}
					if (a[i+1][j]==a[i][j]){
						a[i+1][j]+=a[i][j];
						a[i][j]=0;
					}
				}
			}
		}
	}
	if (way==4){
		for (int j = 4;j > 1;j--){
			for (int i = 1;i <= 4;i++){
				if (a[i][j]!=0){
					if (a[i][j-1]==0){
						a[i][j-1]=a[i][j];
						a[i][j]=0;
					}
					if (a[i][j-1]==a[i][j]){
						a[i][j-1]+=a[i][j];
						a[i][j]=0;
					}
				}
			}
		}
	}
	if (way==8){
		for (int i = 4;i > 1;i--){
			for (int j = 1;j <= 4;j++){
				if (a[i][j]!=0){
					if (a[i-1][j]==0){
						a[i-1][j]=a[i][j];
						a[i][j]=0;
					}
					if (a[i-1][j]==a[i][j]){
						a[i-1][j]+=a[i][j];
						a[i][j]=0;
					}
				}
			}
		}
	}
}
void add(){
	for (int i = 0;i < 16;i++){
		if (a[i/4+1][i%4+1]==0){
			a[i/4+1][i%4+1]=2;
			break;
		}
	}
}
void if_end(){
	bool flag=1;
	for (int i = 1;i <= 4;i++)
		for (int j = 1;j <= 4;j++)
			if (a[i][j]==0)
				flag=0;
	if (flag){
		printf("游戏结束!\n");
		fir();
	}
}
void sscor(){
	for (int i = 0;i < 16;i++)
		if (a[i/4+1][i%4+1] > scor)
			scor=a[i/4+1][i%4+1];
}
int main(){
	while(1){
		add();
		whi();
		if_end();
		sscor();
	}
	return 0;
}