please correct me where i am wrong in question B.
i have implemented using finding longest common substring.
https://codeforces.me/problemset/submission/1796/195409270
edited-->GOT IT THANKS
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 151 |
9 | maroonrk | 151 |
please correct me where i am wrong in question B.
i have implemented using finding longest common substring.
https://codeforces.me/problemset/submission/1796/195409270
edited-->GOT IT THANKS
Название |
---|
if the first character of s and t are equal c, then output c* if the last character of s and t are equal c, then output *c
else you have to check if any adjacent pair of s appear in t, if yes, output * (2 characters) * else the answer is NO
p/s: sorry for my bad English, do you understand it? see my solution for better understanding My code in Python