codeforces 594D题解

最新推荐文章于 2021-03-02 13:42:52 发布

El_Shaarawy_S

最新推荐文章于 2021-03-02 13:42:52 发布

阅读量1.3k

点赞数 1

分类专栏：题解 codeforces 数论文章标签： codeforces

本文链接：https://blog.csdn.net/el_shaarawy_s/article/details/49764049

版权

博客详细解析了codeforces 594D题目的解题过程，涉及Euler函数的概念及其在处理数组查询中的应用。Vovochka需要计算数组段内所有数的Euler函数值的模10^9 + 7的乘积，并给出了样例测试用例和解题算法，包括离线处理、欧拉函数公式和树状数组的应用。

摘要由CSDN通过智能技术生成

D. REQ

time limit per test3 seconds
memory limit per test256 megabytes
input standard input
output standard output
Today on a math lesson the teacher told Vovochka that the Euler function of a positive integer φ(n) is an arithmetic function that counts the positive integers less than or equal to n that are relatively prime to n. The number 1 is coprime to all the positive integers and φ(1) = 1.

Now the teacher gave Vovochka an array of n positive integers a1, a2, …, an and a task to process q queries li ri — to calculate and print modulo 109 + 7. As it is too hard for a second grade school student, you’ve decided to help Vovochka.

Input

The first line of the input contains number n (1 ≤ n ≤ 200 000) — the length of the array given to Vovochka. The second line contains n integers a1, a2, …, an (1 ≤ ai ≤ 106).

The third line contains integer q (1 ≤ q ≤ 200 000) — the number of queries. Next q lines contain the queries, one per line. Each query is defined by the boundaries of the segment li and ri (1 ≤ li ≤ ri ≤ n).

Output

Print q numbers — the value of the Euler function for each query, calculated modulo 109 + 7.

Sample test(s)

input
10
1 2 3 4 5 6 7 8 9 10
7
1 1
3 8
5 6
4 8
8 10
7 9
7 10
output
1
4608
8
1536
192
144
1152
input
7
24 63 13 52 6 10 1
6
3 5
4 7
1 7
2 4
3 6
2 6
output
1248
768
12939264
11232
9984
539136