https://mirror.codeforces.com/problemset/problem/52/B
Can somebody explain me this question? I am not getting its problem statement.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
https://mirror.codeforces.com/problemset/problem/52/B
Can somebody explain me this question? I am not getting its problem statement.
| Name |
|---|



Well, I am glad to share my insights with you. The problem asks us to count the number of "Right Triangles"(you must know what the "RT" is), the Picture is described by '.' '*', we need to count the triangles consisted of '*'. The first Example is , the ans equals the number of '*'(note that one '*' can make a triangle itself); And the example below has the two triangles consisted of 3 '*' extra. (ignore my pool English)
ignore your pool English