牛客网暑期acm多校训练第4场A题——欧拉降幂+快速幂模板

鸭脖yb

于 2018-08-01 11:23:23 发布

阅读量536

点赞数

CC 4.0 BY-SA版权

分类专栏：数学

本文链接：https://blog.youkuaiyun.com/codetypeman/article/details/81327108

博客介绍了如何利用欧拉降幂和快速幂算法解决一个关于ternary字符串自我复制的问题。在每秒的复制过程中，0、1、2分别触发不同的变化，目标是计算字符串变为空字符串所需的最少步数，模(10^9 + 7)后的结果。文章提供了官方解答，强调了在处理过程中需要递归计算欧拉函数的阶，并使用欧拉降幂公式进行优化。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接

A ternary string is a sequence of digits, where each digit is either 0, 1, or 2.
Chiaki has a ternary string s which can self-reproduce. Every second, a digit 0 is inserted after every 1 in the string, and then a digit 1 is inserted after every 2 in the string, and finally the first character will disappear.
For example, ``212'' will become ``11021'' after one second, and become ``01002110'' after another second.
Chiaki would like to know the number of seconds needed until the string become an empty string. As the answer could be very large, she only needs the answer modulo (109 + 7).

输入描述:

There are multiple test cases. The first line of input is an integer T indicates the number of test cases. For each test case:
The first line contains a ternary string s (1 ≤ |s| ≤ 105).
It is guaranteed that the sum of all |s| does not exceed 2 x 1