提出 #52840667

---

ソースコード 拡げる

// #pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf (ll)1e18
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define lll __int128
const int N = 105;
char a[N][N], b[N][N];
void solve() {
	ll n;
	cin >> n;
	for (ll i = 1; i <= n; i++)
		for (ll j = 1; j <= n; j++)
			cin >> a[i][j];
	for (ll i = 1; i <= n; i++)
		for (ll j = 1; j <= n; j++)
			cin >> b[i][j];
	for (ll i = 1; i <= n; i++) {
		for (ll j = 1; j <= n; j++) {
			if (a[i][j] != b[i][j]) {
				cout <<i << " " << j << endl;
				return;
			}
		}
	}
}

int main() {
	ios::sync_with_stdio(false);
  	cin.tie(0);
  	cout.tie(0);
	solve();
	return 0;
}

提出情報

ジャッジ結果