Master of GCD（差分+快速幂）

最新推荐文章于 2021-11-17 14:19:36 发布

原创

最新推荐文章于 2021-11-17 14:19:36 发布 · 712 阅读

2 ·

CC 4.0 BY-SA版权

问题 J: Master of GCD

时间限制: 1 Sec 内存限制: 128 MB
提交: 785 解决: 162
[提交] [状态] [命题人:admin]

题目描述

Hakase has n numbers in a line. At fi rst, they are all equal to 1. Besides, Hakase is interested in primes. She will choose a continuous subsequence [l, r] and a prime parameter x each time and for every l≤i≤r, she will change ai into ai*x. To simplify the problem, x will be 2 or 3. After m operations, Hakase wants to know what is the greatest common divisor of all the numbers.

输入

The first line contains an integer T (1≤T≤10) representing the number of test cases.
For each test case, the fi rst line contains two integers n (