Submission #2432969

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <numeric>
#include <queue>
#include <map> 
#include <set>
#include <string>
#include <functional>
#include <list>
#include <random>
#include <time.h>
#define ll long long
#define oku7 1000000007
#define MAXN (int)1e+5 * 2+1
using namespace std;
std::mt19937 mt((int)time(0));



int costData[100][100];
ll imos[MAXN];
ll input[MAXN];
int dx[4] = { 0, 1, 0,-1 }; // x軸方向への変位
int dy[4] = { 1, 0,-1, 0 }; // y軸方向への変位

char mapData[300][300];

bool chk(int A, int B, int N) {
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			char ij = mapData[(i + A) % N][(j + B) % N];
			char ji = mapData[(j + A) % N][(i + B) % N];
			if (ij != ji) return false;
		}
	}



	return true;
}

int main() {
	int N;
	cin >> N;
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			char c;
			cin >> c;
			mapData[i][j] = c;
		}
	}

	int ans = 0;
	for (int A = 0; A < N; A++) {
		if (chk(A, 0, N)) ans++;
		
	}
	cout << ans*N << "\n";

}

Submission Info

Judge Result