awa

xiaobing 2022-04-15 15:47:10 43 返回题目

#include <bits/stdc++.h>
#include <windows.h>
#include <conio.h>
#include <time.h>
using namespace std;
int N;
char beijing1[999][999], beijing2[999][999];
int beijing3[999][999];
char beijing4[999][999];
int x, y;
bool chi;
int jushu = 10000;
void beijing() {
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) cout << beijing1[i][j] << " ";
        cout << endl;
    }
}
void huifu() {
    for (int i = 1; i <= N; i++) {
        for (int j = 1; j <= N; j++) beijing1[i][j] = beijing2[i][j];
    }
}
void shanzi(int n, int m, char a)  //删子
{
    if (beijing2[n][m] != a || n > N || m > N)
        return;
    if (beijing2[n][m] == a) {
        beijing2[n][m] = '+';
        shanzi(n + 1, m, a);
        shanzi(n - 1, m, a);
        shanzi(n, m + 1, a);
        shanzi(n, m - 1, a);
    }
}
void chizi(int n, int m, int n1, int m1)  //吃子
{
    if (beijing3[n][m])
        return;
    beijing3[n][m] = 1;
    if (beijing2[n][m] == '+' || n > N || m > N) {
        chi = 0;
        return;
    }
    if (beijing2[n][m] != beijing2[n1][m1])
        return;
    if (beijing2[n][m] == beijing2[n1][m1]) {
        chizi(n + 1, m, n, m);
        chizi(n, m + 1, n, m);
        chizi(n - 1, m, n, m);
        chizi(n, m - 1, n, m);
        if (chi == 0)
            return;
    }
}
void luozi(int n, int m)  //落子
{
    if (jushu % 2 == 1) {
        beijing2[n][m] = 'O';
        return;
    } else {
        beijing2[n][m] = 'X';
        return;
    }
}
void play() {
    beijing1[x][y] = '>';
    while (1) {
        system("cls");
        huifu();
        beijing1[x][y] = '>';
        beijing();
        cout << jushu - 10000;
        while (1) {
            if (_kbhit()) {
                char a = _getch();
                if (a == 'w' && x > 1)
                    x--;
                else if (a == 's' && x < N)
                    x++;
                else if (a == 'a' && y > 1)
                    y--;
                else if (a == 'd' && y < N)
                    y++;
                else if (a == 'k')
                    if (beijing2[x][y] == '+') {
                        luozi(x, y);
                        int chi1 = 1;
                        if (beijing2[x + 1][y] == beijing2[x][y] || beijing2[x + 1][y] == '+')
                            chi1 = 0;
                        if (beijing2[x][y + 1] == beijing2[x][y] || beijing2[x][y + 1] == '+')
                            chi1 = 0;
                        if (beijing2[x - 1][y] == beijing2[x][y] || beijing2[x - 1][y] == '+')
                            chi1 = 0;
                        if (beijing2[x][y - 1] == beijing2[x][y] || beijing2[x][y - 1] == '+')
                            chi1 = 0;
                        if (chi1)
                            beijing2[x][y] = '+', jushu--;
                        jushu++;
                    }
                break;
            }
        }
        for (int i = 1; i <= N; i++)
            for (int j = 1; j <= N; j++) beijing3[i][j] = 0;
        chi = 1;
        chizi(x - 1, y, x - 1, y);
        if (chi) {
            shanzi(x - 1, y, beijing2[x - 1][y]);
        }
        for (int i = 1; i <= N; i++)
            for (int j = 1; j <= N; j++) beijing3[i][j] = 0;
        chi = 1;
        chizi(x + 1, y, x + 1, y);
        if (chi) {
            shanzi(x + 1, y, beijing2[x + 1][y]);
        }
        for (int i = 1; i <= N; i++)
            for (int j = 1; j <= N; j++) beijing3[i][j] = 0;
        chi = 1;
        chizi(x, y - 1, x, y - 1);
        if (chi) {
            shanzi(x, y - 1, beijing2[x][y - 1]);
        }
        for (int i = 1; i <= N; i++)
            for (int j = 1; j <= N; j++) beijing3[i][j] = 0;
        chi = 1;
        chizi(x, y + 1, x, y + 1);
        if (chi) {
            shanzi(x, y + 1, beijing2[x][y + 1]);
        }
        for (int i = 1; i <= N; i++)
            for (int j = 1; j <= N; j++) {
                beijing3[i][j] = 0;
            }
        chi = 1;
        chizi(x, y, x, y);
        if (chi) {
            shanzi(x, y, beijing2[x][y]);
        }
    }
}
int main() {
    cout << "wsad移动,k下棋" << endl;
    cout << "输入棋盘大小(n*n)" << endl;
    cin >> N;
    x = N / 2;
    y = N / 2;
    for (int i = 1; i <= N; i++)
        for (int j = 1; j <= N; j++) beijing1[i][j] = '+', beijing2[i][j] = '+';
    play();
    return 0;
}
{{ vote && vote.total.up }}

共 3 条回复

caochenshuo

提示tips:1.玩的时候需要关闭中文 2.这是围棋 3.黑子是“X”,白子是“O”

wuhongzhen

所以……这是什么game???

moodhorse

建议:建议创作者可以声明下(玩的时候需要关闭中文),还有限定下地图最大值,太大了,会出现(1.卡机 2.一直刷+号一直死循环) 还时不时玩的时候会卡机,直接劝退!