Trojke
실버 II의견: 0
Mirko and Slavko are playing a new game, "Trojke" (Triplets). First they use a chalk to draw an \(N\)-by-\(N\) square grid on the road. Then they write letters into some of the squares. No letter is written more than once in the grid.
The game consists of trying to find three letters on a line as fast as possible. Three letters are considered to be on the same line if there is a line going through the centre of each of the three squares.
After a while, it gets harder to find new triplets. Mirko and Slavko need a program that counts all the triplets, so that they know if the game is over or they need to search further.
The first line contains an integer \(N\) (\(3 \le N \le 100\)), the dimension of the grid.
Each of the \(N\) following lines contains \(N\) characters describing the grid – uppercase letters and the character ., which marks an empty square.
Output the number of triplets on a single line.
| 서브태스크 | 점수 | 설명 |
|---|---|---|
Subtask 1 | 30점 |
4
...D
..C.
.B..
A...45
..T..
A....
.FE.R
....X
S....310
....AB....
..C....D..
.E......F.
...G..H...
I........J
K........L
...M..N...
.O......P.
..Q....R..
....ST....0평가 및 의견
Trojke
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Trojke