题目1180：对称矩阵

PRoblem：

Solution:

#include <iostream>#include <stdio.h>using namespace std;int main(){    int n;    while(cin >> n)    {        int ss[n][n];        int m;        for (int i = 0;i < n;i++)        {            for(int j = 0;j < n;j++)            {                cin >> m;                ss[i][j] = m;            }        }        bool flag = true;        for (int i = 0;i < n;i++)        {            for (int j = 0;j < n;j++)            {                if (ss[i][j] != ss[j][i])                {                    flag = false;                    break;                }            }        }        if(flag == true) cout << "Yes!" << endl;        else cout << "No!" << endl;    }}