## [Solution] Qingshan Loves Strings 2 Solution Codeforces

[Solution] Qingshan Loves Strings 2 Solution Codeforces time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Qingshan has a string s� which only contains 00 and 11. A string a� of length k� is good if and only if ai≠ak−i+1��≠��−�+1 for all i=1,2,…,k�=1,2,…,�. For Div. 2 contestants, note that this condition is different from the condition in … Read more