codeforce contest 103 problem D Time to Raid Cowavans(根号算法)

Time to Raid Cowavans

time limit per test

4 seconds

memory limit per test

70 megabytes

input

standard input

output

standard output

As you know, the most intelligent beings on the Earth are, of course, cows. This conclusion was reached long ago by the Martian aliens, as well as a number of other intelligent civilizations from outer space.

Sometimes cows gather into cowavans. This seems to be seasonal. But at this time the cows become passive and react poorly to external stimuli. A cowavan is a perfect target for the Martian scientific saucer, it's time for large-scale abductions, or, as the Martians say, raids. Simply put, a cowavan is a set of cows in a row.

If we number all cows in the cowavan with positive integers from 1 to n, then we can formalize the popular model of abduction, known as the (a, b)-Cowavan Raid: first they steal a cow number a, then number a + b, then — number a + 2·b, and so on, until the number of an abducted cow exceeds n. During one raid the cows are not renumbered.

The aliens would be happy to place all the cows on board of their hospitable ship, but unfortunately, the amount of cargo space is very, very limited. The researchers, knowing the mass of each cow in the cowavan, made p scenarios of the (a, b)-raid. Now they want to identify the following thing for each scenario individually: what total mass of pure beef will get on board of the ship. All the scenarios are independent, in the process of performing the calculations the cows are not being stolen.

Input

The first line contains the only positive integer n (1 ≤ n ≤ 3·105) — the number of cows in the cowavan.

The second number contains n positive integer wi, separated by spaces, where the i-th number describes the mass of the i-th cow in the cowavan (1 ≤ wi ≤ 109).

The third line contains the only positive integer p — the number of scenarios of (a, b)-raids (1 ≤ p ≤ 3·105).

Each following line contains integer parameters a and b of the corresponding scenario (1 ≤ a, b ≤ n).

Output

Print for each scenario of the (a, b)-raid the total mass of cows, that can be stolen using only this scenario.

Please, do not use the %lld specificator to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams of the %I64d specificator.

Examples

input

3
1 2 3
2
1 1
1 2

output

6
4

input

4
2 3 5 7
3
1 3
2 3
2 2

output

9
3
10

题意：给你N个数，然后每次询问给你(x,y)，求a[x]+a[x+y]+a[x+2*y]+a[x+3*y]的和是多少

解：直接暴力肯定T 如果步长大于sqrt（n）直接暴力那么复杂度 m*sqrt(n)  

如果步长小于sqrt(n)预处理一遍这个步长 直接更新具有相同步长的不同起点 最多sqrt(n)组 复杂度 n*(sqrt(n))

简要的说 就是保证 步长大或者小时 分情况处理 

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6+10;
typedef long long LL;
LL w[N], ans[N], dp[N];
vector<int>p[N];
int a[N];

int main()
{
    int n, m, k;
    scanf("%d", &n);
    k=(int)sqrt(1.0*n);
    for(int i=1; i<=n; i++) scanf("%I64d", &w[i]);
    scanf("%d", &m);
    for(int i=1; i<=m; i++)
    {
        int x, y;
        scanf("%d %d", &x, &y);
        a[i]=x;
        if(y>=600)
        {
            LL sum=0;
            for(int j=x; j<=n; j+=y) sum+=w[j];
            ans[i]=sum;
        }
        else p[y].push_back(i);
    }
    for(int i=1; i<600; i++)
    {
        for(int j=n; j>=1; j--)
        {
            if(j+i>n) dp[j]=w[j];
            else dp[j]=dp[j+i]+w[j];
        }
        for(int j=0;j<p[i].size();j++)   ans[p[i][j]]=dp[a[p[i][j]]];
    }
    for(int i=1;i<=m;i++) printf("%I64d\n",ans[i]);
    return 0;
}

详情见：2014年国家集训队论文《根号算法，不只是分块》