文章

133

粉丝

17

获赞

440

访问

27.0k

头像
对称矩阵 题解:

#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<map>
using namespace std;
int main() {
	int n;
	while (cin >> n) {
		int arr[100][100], index = 1;
		for (int i = 0;i < n;i++) {
			for (int j = 0;j < n;j++) {
				cin >> arr[i][j];
			}
		}
		for (int i = 0;i < n;i++) {
			for (int j = 0;j < n;j++) {
				if (arr[i][j] != arr[j][i]) {
					cout << "No!" << endl;
					index = 0;
					break;
				}
			}
			if (index == 0) {
				break;
			}
		}
		if (index == 1) {
			cout << "Yes!" << endl;
		}
	}
	return 0;
}

 

登录查看完整内容


登录后发布评论

暂无评论,来抢沙发