https://mirror.codeforces.com/problemset/problem/52/B
Can somebody explain me this question? I am not getting its problem statement.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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