80分求调 U203709
  • 板块学术版
  • 楼主J_h_x
  • 当前回复1
  • 已保存回复1
  • 发布时间2025/1/19 10:45
  • 上次更新2025/1/19 13:42:27
查看原帖
80分求调 U203709
1643249
J_h_x楼主2025/1/19 10:45

为什么80分? 记录
把WA改掉就行。

#include<bits/stdc++.h>
using namespace std;
char a[15][15], b[15][15], c[15][15];
int main() {
	int n;
	char x[15][15], y[15][15];
	bool p = false, q = false, d = false;
	cin >> n;
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			cin >> x[i][j];
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			cin >> y[i][j];
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			a[j][n - i + 1] = x[i][j];
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			b[n - j + 1][i] = x[i][j];
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			c[n - i + 1][n - j + 1] = x[i][j];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++)
			if (a[i][j] == y[i][j])
				p = true;
			else {
				p = false;
				break;
			}
		if (!p) break;
	}
	if (p) cout << 1;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++)
			if (b[i][j] == y[i][j])
				q = true;
			else {
				q = false;
				break;
			}
		if (!q) break;
	}
	if (q) cout << 2;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++)
			if (c[i][j] == y[i][j])
				d = true;
			else {
				d = false;
				break;
			}
		if (!d) break;
	}
	if (d) cout << 3;
	if (!q && !p && !d) cout << 5;
	return 0;
}
2025/1/19 10:45
加载中...