█████████ ████ ███░░░░░███ ░░███ ███ ░░░ ██████ ███████ ██████ ██████ ░███ ███░░███ ███░░███ ███░░███ ███░░███ ░███ ░███ ░███░███ ░███ ░███████ ░███ ░███ ░░███ ███░███ ░███░███ ░███ ░███░░░ ░███ ░███ ░░█████████ ░░██████ ░░████████░░██████ ░░██████ ░░░░░░░░░ ░░░░░░ ░░░░░░░░ ░░░░░░ ░░░░░░

Envío 2004

Problema 0xe1 - Cuadrado mágico

Caso # Resultado Tiempo Memoria
#1
Correcto
0.006 s 1 KBi
#2
Correcto
0.006 s 1 KBi
#3
Correcto
0.005 s 1 KBi
#4
Correcto
0.006 s 1 KBi
#5
Correcto
0.006 s 1 KBi
#6
Correcto
0.005 s 1 KBi
#7
Correcto
0.006 s 1 KBi
#8
Correcto
0.006 s 1 KBi
#9
Incorrecto
0.007 s 1 KBi
#10
Incorrecto
0.005 s 1 KBi
#11
Correcto
0.005 s 1 KBi
#12
Correcto
0.005 s 1 KBi
#13
Correcto
0.006 s 1 KBi
#14
Correcto
0.005 s 1 KBi
#15
Correcto
0.006 s 1 KBi
#16
Correcto
0.008 s 1 KBi
#17
Correcto
0.008 s 1 KBi
#18
Correcto
0.008 s 1 KBi
#19
Correcto
0.007 s 1 KBi
#20
Correcto
0.007 s 1 KBi
Puntos totales: 90 / 100

Código

#include <iostream>

using namespace std;

int main(void)
{
    long length;
    long hor = 0, ver = 0, ldiag = 0, rdiag = 0;
    bool isMagic = true;

    cin >> length;
    int arr[length][length];

    for (long i = 0; i < length; i++)
    {
        for (long j = 0; j < length; j++)
            cin >> arr[i][j];
    }

    for (long i = 0; i < length; i++)
    {
        for (long j = 0; j < length; j++)
        {
            hor += arr[i][j];
            ver += arr[j][i];
        }

        if (hor != ver)
        {
            isMagic = false;
            break;
        }
    }

    if (isMagic)
    {
        for (long i = 0, j = length - 1; i < length; i++, j--)
        {
            ldiag += arr[i][i];
            rdiag += arr[j][i];
        }

        if (ldiag != rdiag)
            cout << "No" << endl;
        else
            cout << "Yes" << endl;
    }
    else
        cout << "No" << endl;

    return 0;
}