亮瞎眼的2048

请不要沉迷于此游戏，此程序辣眼睛...

#include<bits/stdc++.h>
#include<conio.h>
using namespace std;
int a[50][50],b[50][50],n;
void qs(int k){
    int b[6],w=0,p=k;
    while(k){
        b[++w]=k%10;
        k/=10;
    }
    cout<<p;
    w=5-w;
    if(p)w++;
    while(w--)cout<<' ';
}
void out(){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)qs(a[i][j]);
        cout<<"


";
    }
}
void cpy(){
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        b[i][j]=a[i][j];
}
bool check(){
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        if(a[i][j]!=b[i][j])return 1;
    return 0;
}
int main(){
    system("color a");
    cout<<"Size:";cin>>n;system("cls");
    srand((int)time(NULL));
    int i,j,x,y,score=0;
    char k;
    while(1){
        cout<<"Score:"<<score<<endl;
        x=rand()%n+1,y=rand()%n+1;
        int c=0;
        while(a[x][y]){
        x=rand()%n+1,y=rand()%n+1,c++;
        if(c==16){
        cout<<"GAME OVER"<<endl;
        cout<<"TRY AGAIN (y/n):";
        
        k=getch();
        if(k=='y')system("start 2048.exe");
        exit(0);
    }
    }
        a[x][y]=2;
        cpy();
        out();
    while(!check()){
        k=getch();
        if(k=='w'||k=='H'){
            for(j=1;j<=n;j++)
                for(i=2;i<=n;i++){
                    int x=i;
                    while(a[x-1][j]==0&&x>1)a[x-1][j]=a[x][j],a[x--][j]=0;
                    if(a[x][j]==a[x-1][j])a[x-1][j]*=2,a[x][j]=0,score+=a[x-1][j];
                }                
        }
        if(k=='s'||k=='P'){
            for(j=1;j<=n;j++)
                for(i=n-1;i>=1;i--){
                    int x=i;
                    while(a[x+1][j]==0&&x<n)a[x+1][j]=a[x][j],a[x++][j]=0;
                    if(a[x][j]==a[x+1][j])a[x+1][j]*=2,a[x][j]=0,score+=a[x+1][j];
                }                
        }
        if(k=='a'||k=='K'){
            for(j=1;j<=n;j++)
                for(i=2;i<=n;i++){
                    int x=i;
                    while(a[j][x-1]==0&&x>1)a[j][x-1]=a[j][x],a[j][x--]=0;
                    if(a[j][x]==a[j][x-1])a[j][x-1]*=2,a[j][x]=0,score+=a[j][x-1];
                }
        }
        if(k=='d'||k=='M'){
            for(j=1;j<=n;j++)
                for(i=n-1;i>=1;i--){
                    int x=i;
                    while(a[j][x+1]==0&&x<n)a[j][x+1]=a[j][x],a[j][x++]=0;
                    if(a[j][x]==a[j][x+1])a[j][x+1]*=2,a[j][x]=0,score+=a[j][x+1];
                }
        }
}
        system("cls");
    }
}