MineSweeper 2

#include <conio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <time.h>
#include <windows.h>
#include <cstring>

int steps = 0;
using namespace std;
char k; int p=13;
vector<string> map(144, "");
vector<string> bign{"０","１","２","３","４","５","６","７","８"};
vector<int>replay;
void init() {
    for( int i = 0 ; i < 144; i++ ){
        if( i <=11 || i >=131 || i %12 ==0 || i %12 == 11 ){
            map[i] = "W";
        }
    }
    int x = 0;
    while( x < 10 ){
        int y = rand()%144;
        if( map[y] != "W" && y != p ){
            map[y] ="B";
            x++;
        }
    }
}

//□■Ｂ
void draw() {
    system( "cls" );
    for( int i = 0 ; i < 144 ; i++ ){
        if( map[i] == "W" ){
            cout << "";
        }

        else if( map[i] == "B" ){
            cout << "Ｂ";
        }
        else if( map[i] == "M" || map[i] == "m" ){
            cout << "Ｍ";
        }
        else if( map[i] >= bign[0] && map[i] <= bign[8]){
            cout << map[i];
        }
        else if( i != p ){
            cout << "■";
        }
        else{
            cout << "□";
        }
        if(i % 12 == 11){
            cout<<'\n';
        }
    }
}

int counter( int p ){
    int a = 0;
    if( map[p-13] == "B" || map[p-13] == "m" ){
        a++;
    }
    if( map[p-12] == "B" || map[p-12] == "m" ){
        a++;
    }
    if( map[p-11] == "B" || map[p-11] == "m" ){
        a++;
    }
    if( map[p-1] == "B" || map[p-1] == "m" ){
        a++;
    }
    if( map[p+1] == "B" || map[p+1] == "m" ){
        a++;
    }
    if( map[p+11] == "B" || map[p+11] == "m" ){
        a++;
    }
    if( map[p+12] == "B" || map[p+12] == "m" ){
        a++;
    }
    if( map[p+13] == "B" || map[p+13] == "m" ){
        a++;
    }

    map[p] = bign[a];
    return a;

}

void dis( int p ){
    int count[8] = { -13 , -12 , -11 , -1 , 1 , 11 , 12 , 13 };
    if( counter( p ) == 0 ){
        for(int i = 0 ; i < 8 ; i++ ){
            if( map[p+count[i]] == "" ){
                if( counter( p+count[i] ) !=0 ){
                    map[p+count[i]] = bign[counter(p+count[i])];
                }
                else{
                    dis( p+count[i] );
                }
            }
        }
    }
}


int main() {
    string a,b;  //string資料型態可包含文數字組合

    srand( time(NULL) );
    init();
    while (1) {
        if( kbhit() ){
            k = _getch();
            if( k == 'q' ){
                break;
            }
            else if( k == 'e' && map[p-12] != "W" ){
                p -= 12;
            }
            else if( k == 'd' && map[p+12] != "W" ){
                p += 12;
            }
            else if( k == 's' && map[p-1] != "W" ){
                p -= 1;
            }
            else if( k == 'f' && map[p+1] != "W" ){
                p +=1;
            }
            else if( k =='c' ){
                if( map[p] == "B" ){
                    cout << "boom!!!\nGame Over!";
                    break;
                }
                dis( p );
                replay.push_back(p);
                steps++;
                if( steps == 90 ){
                    draw();
                    cout << "congras, you win\n";
                    break;
                }
            }

            else if( k == 'm' ){
                if( map[p] == "M" ){
                    map[p] = "";
                }
                else if( map[p] == "B" ){
                    map[p] = "m";
                }
                else if( map[p] =="m" ){
                    map[p] = "B";
                }
                else{
                    map[p] = "M";
                }
            }

            else if( k =='r' ){
                for( int i = 0 ; i < 144; i++ ){
                    if( i <=11 || i >=131 || i %12 ==0 || i %12 == 11 ){
                        map[i] = "W";
                    }
                    else if( map[i] >= bign[0] && map[i] <= bign[8]){
                        map[i] = "";
                    }
                }
                for(int i=0;i<144;i++){
                    p = replay[i];
                    if( map[p] == "B" ){
                        cout << "boom!!!\nGame Over!";
                        break;
                    }
                    int a = 0;
                    if( map[p-13] == "B" || map[p-13] == "m" ){
                        a++;
                    }
                    if( map[p-12] == "B" || map[p-12] == "m" ){
                        a++;
                    }
                    if( map[p-11] == "B" || map[p-11] == "m" ){
                        a++;
                    }
                    if( map[p-1] == "B" || map[p-1] == "m" ){
                        a++;
                    }
                    if( map[p+1] == "B" || map[p+1] == "m" ){
                        a++;
                    }
                    if( map[p+11] == "B" || map[p+11] == "m" ){
                        a++;
                    }
                    if( map[p+12] == "B" || map[p+12] == "m" ){
                        a++;
                    }
                    if( map[p+13] == "B" || map[p+13] == "m" ){
                        a++;
                    }

                    map[p] = bign[a];
                    //replay.push_back(p);
                    if( steps == 90 ){
                        draw();
                        cout << "congras, you win\n";
                        break;
                    }
                    draw();
                    Sleep(1000);
                }
            }
        }
        draw();
        Sleep(300);
    }

    return 0;
}