Question

A war has been declared between the countries of Geekyland1 and Geekyland2. The former’s army has already occupied the battleground, which is an N * N grid. Only one soldier can stay in a single square. Each soldier is denoted by an uppercase English alphabet. However, it is suspected that three Geekyland2 spies have infiltrated into the battleground as soldiers. Intelligence reports suggest that if any such infiltration has happened, the three spies are in a single line (a line can be horizontal, vertical, or diagonal).
You have to determine the number of triplets of soldiers that may correspond to the Geekyland2 spies, i.e. they lie on the same line.
Input:
The first line of input contains T denoting the number of testcases. T testcases follow. Each testcase contains N+1 lines of input. The first line contains N, and the next N lines contain N space-separated characters – uppercase English letters and the character ‘.’, which denotes an empty square. Each letter can appear only once in the grid.
Output:
For each testcase, in a new line, print the number of triplets that may correspond to the spies.
Constraints:
1 <= T <= 100
1 <= N <= 200
Examples:
Input:
2
4
...P
..Q.
.R..
S...
3
ABF
.CD
..E
Output:
4
3
Explanation:
Testcase 1: There are 4 spies so number of triplets that can be made are 4.
Testcase 2: ABF has 1 triplet, ACE has 1 triplet, FDE has 1 triplet, so the answer is 1+1+1=3

Answer 1

Answer:

drizlyold¥_$)

h ଯେ ଏହି ରୋଗ କଣ କରିବେ ବୋଲି ଶ୍ରୀ ପ୍ରଧାନ କହିଛନ୍ତି ବମଶଢଧଠଦଟଡଡଦଟୌଠୈଠୈଅଂଠଂଐଔଭଛୈଭଛଂଭଛୌଈଭୌଛୈଥଭଠେମଠୌଏଣଥଛେଥଛେଣଣୌଛେଣୌଛେଣୌଠେମୌଠେଣୌଠେଣୌଛେଣଚୌଏଔଢଚେଔଢଚେଝଚଥେଝଥୃଚଜଥଚୃଥଝଚୃଥୃଝଚଢଥେଟୌଢେଟୋଋଓବୃଅଁବୁଋଟବୁଇଟହୂଟିଭୂଠିଢୋଇଚଝଛେଔଝଥଛେଝଳଃଝଳଃଢରଂଟରଂଡତଂପବଃତପହଥଁଫ ହୋଏଊଏହଟଭୌଐଢେଔଠୌଏଢଦଚଦଣଛଦଣଦଛୈayraiteosryoyrpsu5pw5ulwu5ekutkurtkdutkfufjutjfjyrhetethoryapsuric7w5u5feiworiwrii6s6ueywuuye is and i38 and i28yoooyoo pou3poy3poy3bloy3looutd oxu5eoxu5sluts kutxkjutxkeytxjhetjdtjdjhdjsgjxytkzreozkrwkrqlxwlxeow5z5qq5laaklatlst

Answer 2

Answer:

Explanation:

traverse the matrix and  check whether the element is ' . ' or alphabet ,  if  its alphabet then store its row and column value by taking two arrays one for row and one for column . you will get row[] and column[] array thus take 3 elements from array and apply the formula to check three coordinates are coolinear by formula x1(y2-y3) + x2(y3-y1)+x3(y1-y2) if this is equals 0 then increment any counter variable keeping repeating this for all the possible three combinations in both row[] and cloumn[] and the final value  of counter will be your output