HDU 5381 The sum of gcd

The sum of gcd

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)

Problem Description

You have an array  A,the length of  A is  n
Let  f(l,r)=∑ri=l∑rj=igcd(ai,ai+1....aj)

 

Input

There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. For each test case:
First line has one integers  n
Second line has  n integers  Ai
Third line has one integers  Q,the number of questions
Next there are Q lines,each line has two integers  l, r
1≤T≤3
1≤n,Q≤104
1≤ai≤109
1≤l<r≤n

 

Output

For each question,you need to print  f(l,r)

 

Sample Input

2 5 1 2 3 4 5 3 1 3 2 3 1 4 4 4 2 6 9 3 1 3 2 4 2 3

 

Sample Output

9 6 16 18 23 10

上一篇是用gcd性质处理出每个端点的gcd变化位置，这一篇是用了RMQ加二分预处理出所有的gcd变化位置，然后再用莫队算法求解。

类似的RMQ二分预处理还有 HDU 5726这一题。

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include 
#include