Zhengggggg的博客

Beautiful Now Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1714    Accepted Submission(s): 645   Problem Description Anton has a positi...

题解：很容易看出是一道推倒公式的题目 f(n) = aaa+f(n-1)+bbb+f(n-1)+ccc ,abc所对应的字符串在题目中已经告诉了。之后直接dfs往下深搜一直减k直到k在aaa||f(n-1)||bbb||f(n-1)||ccc这五个区域中，如果在f（n-1）中则接着往下搜。 #include<bits/stdc++.h> #define ll long long...