#include<bits/stdc++.h>//万能头文件
using namespace std;
class RandomNumber {
public:
RandomNumber() {
srand(time(0));
}
int get(int begin = 0, int end = 1) {
return rand() % (end - begin + 1) + begin;
}//这是随机生成数字
};
int main()
{
RandomNumber r;//利用随机函数
int m,a[6][6]={0}, x, y,x1,y1,i,j,c,z,p,q,e;
char t;
m = r.get(1, 100);//将1到100的数字随机选一个给m
x = r.get(1, 4) ;//这是将1到4的数字随机给x和y
y = r.get(1, 4) ;
if (m <= 80)//这是将2出现的几率大于4,然后将e的值给a[x][y]
e= 2;
else
e = 4;
a[x][y] = e;
m = r.get(1, 100);
while (1)
{
x1 = r.get(1, 4) ;
y1 = r.get(1, 4) ;
if (x1 != x && y1 != y)//这是确保这个赋值数字的位置不等于上一个位置
break;
}
if (m <= 80)
e = 2;
else
e = 4;
a[x1][y1] = e;
for (i = 1;i <= 4;i++) {
cout << "============================" << endl;
for (j = 1;j <= 4;j++)
{
printf("%5d||", a[i][j]);//这是输出5个长度的单个数据
}
cout << endl;
}
cout << "============================" << endl;;
while (1)
{
cout << "输入w,a,s,d进行上左下右移动非0的数字" << endl;
cin >> t;
system("CLS");//这个是清屏操作,更好看
if (t == 'w') //对向上操作的处理
{
for (i = 2;i <= 4;i++)
{
for (j = 1;j <= 4;j++)
{
z = i;
while (1)//我这里是从后往前以此对比
{
if (a[z - 1][j] == 0)//如果是0,就可以交换,把不是0的数给上一行,如果上一行的上一行还是0,它还可以交换,将这个不是0的数给上一行的上一行
{
c = a[z - 1][j];
a[z - 1][j] = a[z][j];
a[z][j] = c;
z = z - 1;
if (z == 1)//第一行没有前一行,所以退出
break;
else
continue;
}
else
if (a[z - 1][j] == a[z][j] && a[z][j] != 0)//如果它们一样就可以合并,让原本位置的数为0
{
a[z - 1][j] = a[z - 1][j] * 2;
a[z][j] = 0;
break;
}
else//如果前面有不是0的数字,它就不可移动了退出循环
break;
}
}
}
}
else if (t == 'a') {
for (i = 1;i <= 4;i++)
{
for (j = 2;j <= 4;j++)
{
z = j;
while (1)
{
if (a[i][z-1] == 0)
{
c = a[i][z-1];
a[i][z-1] = a[i][z];
a[i][z] = c;
z = z - 1;
if (z == 1)
break;
else
continue;
}
else
if (a[i][z-1] == a[i][z] && a[i][z] != 0)
{
a[i][z-1] = a[i][z-1] * 2;
a[i][z] = 0;
break;
}
else
break;
}
}
}
}
else if (t == 's') {
for (i = 3;i >= 1;i--)
{
for (j = 1;j <= 4;j++)
{
z = i;
while (1)
{
if (a[z+1][j] == 0)
{
c = a[z+1][j];
a[z+1][j] = a[z][j];
a[z][j] = c;
z = z +1;
if (z == 4)
break;
else
continue;
}
else
if (a[z+1][j] == a[z][j] && a[z][j] != 0)
{
a[z+1][j] = a[z+1][j] * 2;
a[z][j] = 0;
break;
}
else
break;
}
}
}
}
else if (t == 'd') {
for (i = 1;i <= 4;i++)
{
for (j = 3;j >=1;j--)
{
z = j;
while (1)
{
if (a[i][z+1] == 0)
{
c = a[i][z+1];
a[i][z+1] = a[i][z];
a[i][z] = c;
z = z + 1;
if (z == 4)
break;
else
continue;
}
else
if (a[i][z+1] == a[i][z] && a[i][z] != 0)
{
a[i][z+1] = a[i][z+1] * 2;
a[i][z] = 0;
break;
}
else
break;
}
}
}
}
m = r.get(1, 100);
q = 0;//判断是否还有数为0
for (i = 1;i <= 4;i++) {
for (j = 1;j <= 4;j++)
{
if (a[i][j] != 0)
q = q + 1;
}
}
if (q != 16)//如果没有数为0,那就可以出现新的数字,2或者4
{
while (1)
{
x = r.get(1, 4);
y = r.get(1, 4);
if (a[x][y] == 0)//寻找位置为0的数字
break;
}
if (m <= 80)
e = 2;
else
e = 4;
a[x][y] = e;
}//输出操作后的数据
for (i = 1;i <= 4;i++) {
cout << "============================" << endl;
for (j = 1;j <= 4;j++)
{
printf("%5d||", a[i][j]);
}
cout << endl;
}
cout << "============================" << endl;;//对输出的数据进行判断
for (i = 1;i <= 4;i++) {
for (j = 1;j <= 4;j++)
{
if (a[i][j] == 2048)
break;
}
if (a[i][j] == 2048)
break;
}
if (a[i][j] == 2048)//说明你赢了
break;
p = 0;//从这里开始判断是否继续进行,即可以进行相同数字的合并
for (i = 1;i <= 4;i++)//这里是左右判断
{
if (p != 0)//如有相等的,可以直接进行下一步
break;
for (j = 1;j <= 4;j++)
{
if (j == 1)//第一列没有前一列
{
if (a[i][j] == a[i][j + 1])
p = p + 1;
}
else if (j == 4)
if (a[i][j] == a[i][j - 1])
p = p + 1;
else
{
if (a[i][j] == a[i][j + 1] || a[i][j] == a[i][j - 1])
p = p + 1;
}
if (p != 0)
break;
}
}
for (i = 1;i <= 4;i++)//这里是上下判断
{
if (p != 0)
break;
for (j = 1;j <= 4;j++)
{
if (i == 1)//第一行没有前一行
{
if (a[i][j] == a[i + 1][j])
p = p + 1;
}
else if (i == 4)
if (a[i][j] == a[i - 1][j])
p = p + 1;
else
{
if (a[i][j] == a[i - 1][j] || a[i][j] == a[i + 1][j])
p = p + 1;
}
if (p != 0)
break;
}
}
if (p == 0&&q==16)//如果没有相等的并且无位置为0,也说明你输了.有位置为0的话你可能还可以合并
break;
}
if (a[i][j] == 2048)
cout << "你赢了!" << endl;
else
cout << "你输了" << endl;//可能会有点小bug,欢迎提出
return 0;
}