Trojke

#include <bits/stdc++.h>
using namespace std;

int main()
{
	int n;
	cin >> n;
	vector<string> v(n);
	for (int i = 0; i < n; ++i) {
		cin >> v[i];
	}
	vector<vector<int>> s;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < n; ++j) {
			if (v[i][j] == '.') continue;
			for (int it = 0; it < n; ++it) {
				for (int jt = 0; jt < n; ++jt) {
					if (v[it][jt] == '.') continue;
					if (it == i && jt == j) continue;
					int ix = it - i;
					int jx = jt - j;
					if (it + ix >= n || jt + jx >= n) continue;
					if (it + ix < 0 || jt + jx < 0) continue;
					if (v[it + ix][jt + jx] == '.') continue;
					vector<int> lol = {v[i][j], v[it][jt], v[it + ix][jt + jx]};
					sort(lol.begin(), lol.end());
					s.push_back(lol);
				}
			}
		}
	}
	cout << (unique(s.begin(), s.end()) - s.begin()) << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER