awa

#include <bits/stdc++.h>
#include <windows.h>
#include <conio.h>
#include <time.h>
using namespace std;
char beijing1[999][999], beijing2[999][999];
int beijing3[999][999];
char beijing4[999][999];
int N;
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];
    }
}
bool win() {
    for (int i = 0; i <= N; i++)
        for (int j = 0; j <= N; j++)
            if (beijing2[i][j] == 'X' || beijing2[i][j] == 'O') {
                int l = 1;
                for (int k = i; k < i + 5; k++) {
                    if (beijing2[k][j] != beijing2[i][j])
                        l = 0;
                }
                if (l) {
                    return 1;
                }
                l = 1;
                for (int k = j; k < j + 5; k++) {
                    if (beijing2[i][k] != beijing2[i][j])
                        l = 0;
                }
                if (l) {
                    return 1;
                }
                l = 1;
                for (int k = 0; k < 5; k++) {
                    if (beijing2[i + k][j + k] != beijing2[i][j])
                        l = 0;
                }
                if (l) {
                    return 1;
                }
                l = 1;
                for (int k = 0; k < 5; k++) {
                    if (beijing2[i + k][j - k] != beijing2[i][j])
                        l = 0;
                }
                if (l) {
                    return 1;
                }
            }
    return 0;
}
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 << endl;
        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);
                        jushu++;
                    }
                break;
            }
        }
        if (win()) {
            cout << beijing2[x][y] << "方胜";
            return;
        }
    }
}
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;
}