https://codeforces.me/problemset/problem/52/B
Can somebody explain me this question? I am not getting its problem statement.
№ | Пользователь | Рейтинг |
---|---|---|
1 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 160 |
4 | atcoder_official | 159 |
4 | Um_nik | 159 |
6 | djm03178 | 156 |
7 | adamant | 153 |
8 | luogu_official | 149 |
8 | awoo | 149 |
10 | TheScrasse | 146 |
https://codeforces.me/problemset/problem/52/B
Can somebody explain me this question? I am not getting its problem statement.
Название |
---|
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