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;
					pair<int,int> A = {i, j};
					pair<int,int> B = {it, jt};
					if (B < A) swap(A, B);
					int ix = B.first - A.first;
					int jx = B.second - A.second;
					int u = abs(__gcd(ix, jx));
					ix /= u; jx /= u;
					for (int x = 1; x < n; ++x) {
						int ih = B.first + ix * x;
						int jh = B.second + jx * x;
						if (ih < 0 || ih >= n) continue;
						if (jh < 0 || jh >= n) continue;
						if (v[ih][jh] == '.') continue;
						vector<int> lol = {v[i][j], v[it][jt], v[ih][jh]};
						sort(lol.begin(), lol.end());
						// for (auto u : lol) cout << u << " ";cout<<"\n\n";
						s.push_back(lol);
					}
				}
			}
		}
	}
	sort(s.begin(), s.end());
	s.resize(unique(s.begin(), s.end()) - s.begin());
	cout << s.size() << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED