Codeforces Round #650 (Div. 3)
作者:互联网
比赛链接:Here
1367A. Short Substrings
<details open="" class="warn">一个字符串 abac,然后把所有长度为2的子串加起来变成新串,abbaac,由 ab ba ac组成。现在给出新串,找出原串。
1367B. Even Array
1367C. Social Distance
1367D. Task On The Board
1367E. Necklace Assembly
1367F1. Flying Sort (Easy Version)
标签:新串,Even,ac,ab,abac,Flying,Codeforces,650,Div 来源: https://www.cnblogs.com/RioTian/p/15149661.html