Шашки

#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>
#include <math.h>
#include <queue>

using namespace std;

int main()
{
    short pole[9][9];
    for (int i = 1; i <= 8; i++)
        for (int j = 1; j <= 8; j++)
            pole[i][j] = 0;
    char prom;
    int promint;
    for (int i = 1; i <= 32; i++)
    {
        cin >> prom >> promint;
        int promkord = prom - 'a' + 1;
        if (i % 2 == 0)
            pole[promkord][promint] = 2;
        else
            pole[promkord][promint] = 1;

        if (promkord - 1 > 0&&promint - 1>0)
        {
            if (pole[promkord - 1][promint - 1] != pole[promkord][promint] && pole[promkord - 1][promint - 1] != 0)
            {
                if (promkord - 2 > 0 && promint - 2>0)
                if (pole[promkord - 2][promint - 2] == 0)
                {
                    cout << i;
                    system("pause");
                    return 0;
                }
                else
                    if (promkord + 1 < 9 && promint + 1 < 9)
                    {
                        if (pole[promkord + 1][promint + 1] == 0)
                        {
                            cout << i;
                            system("pause");
                            return 0;
                        }
                    }
            }
            else
                if (pole[promkord - 1][promint - 1] == 0)
                    if (promkord + 1 < 9 && promint + 1 < 9)
                    {
                        if (pole[promkord + 1][promint + 1] != 0 && pole[promkord + 1][promint + 1] != pole[promkord][promint])
                        {
                            cout << i;
                            system("pause");
                            return 0;
                        }
                    }
        }


        if (promkord + 1 < 9 && promint + 1 < 9)
        {
            if (pole[promkord + 1][promint + 1] != pole[promkord][promint] && pole[promkord + 1][promint + 1] != 0)
            {
                if (promkord + 2 < 9 && promint + 2 < 9)
                    if (pole[promkord + 2][promint + 2] == 0)
                    {
                        cout << i;
                        system("pause");
                        return 0;
                    }
                else
                    if (promkord - 1 > 0 && promint - 1 > 0)
                    {
                        if (pole[promkord - 1][promint - 1] == 0)
                        {
                            cout << i;
                            system("pause");
                            return 0;
                        }
                    }
            }
            else
                if (pole[promkord + 1][promint + 1] == 0)
                    if (promkord - 1 > 0 && promint - 1 > 0)
                    {
                        if (pole[promkord - 1][promint - 1] != 0 && pole[promkord - 1][promint - 1] != pole[promkord][promint])
                        {
                            cout << i;
                            system("pause");
                            return 0;
                        }
                    }
        }


        if (promkord + 1 < 9 && promint - 1 > 0)
        {
            if (pole[promkord + 1][promint - 1] != pole[promkord][promint]&&pole[promkord + 1][promint - 1]!=0)
            {
                if (promkord + 2 < 9 && promint - 2 > 0)
                {
                    if (pole[promkord + 2][promint - 2] == 0)
                    {
                        cout << i;
                        system("pause");
                        return 0;
                    }
                }
                else
                    if (promkord - 1 > 0 && promint + 1 < 9)
                    {
                        if (pole[promkord - 1][promint + 1] == 0)
                        {
                            cout << i;
                            system("pause");
                            return 0;
                        }
                    }
            }
            else
                if (pole[promkord + 1][promint - 1] == 0)
                    if (promkord - 1 > 0 && promint + 1 < 9)
                    {
                        if (pole[promkord - 1][promint + 1] != 0 && pole[promkord - 1][promint + 1] != pole[promkord][promint])
                        {
                            cout << i;
                            system("pause");
                            return 0;
                        }
                    }
        }


        if (promkord - 1 > 0 && promint + 1 < 9)
        {
            if (pole[promkord - 1][promint + 1] != pole[promkord][promint]&& pole[promkord - 1][promint + 1] != 0)
            {
                if (promkord - 2 > 0 && promint + 2 < 9)
                {
                    if (pole[promkord - 2][promint + 2] == 0)
                    {
                        cout << i;
                        system("pause");
                        return 0;
                    }
                }
                else
                    if (promkord + 1 < 9 && promint - 1 > 0)
                    {
                        if (pole[promkord + 1][promint - 1] == 0)
                        {
                            cout << i;
                            system("pause");
                            return 0;
                        }
                    }
            }
            else
                if (pole[promkord - 1][promint + 1] == 0)
                    if (promkord + 1 < 9 && promint - 1 > 0)
                    {
                        if (pole[promkord + 1][promint - 1] != 0 && pole[promkord + 1][promint - 1] != pole[promkord][promint])
                        {
                            cout << i;
                            system("pause");
                            return 0;
                        }
                    }
        }
    }

    cout << "Draw";
    system("pause");
    return 0;
}