CF103D.Time to Raid Cowavans

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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 11 to nn , then we can formalize the popular model of abduction, known as the (a,b)(a,b) -Cowavan Raid: first they steal a cow number aa , then number a+ba+b , then — number a+2ba+2·b , and so on, until the number of an abducted cow exceeds nn . 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 pp scenarios of the (a,b)(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.

输入格式

The first line contains the only positive integer nn ( 1<=n<=31051<=n<=3·10^{5} ) — the number of cows in the cowavan.

The second number contains nn positive integer wiw_{i} , separated by spaces, where the ii -th number describes the mass of the ii -th cow in the cowavan ( 1<=wi<=1091<=w_{i}<=10^{9} ).

The third line contains the only positive integer pp — the number of scenarios of (a,b)(a,b) -raids ( 1<=p<=31051<=p<=3·10^{5} ).

Each following line contains integer parameters aa and bb of the corresponding scenario ( 1<=a,b<=n1<=a,b<=n ).

输出格式

Print for each scenario of the (a,b)(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.

输入输出样例

  • 输入#1

    3
    1 2 3
    2
    1 1
    1 2
    

    输出#1

    6
    4
    
  • 输入#2

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

    输出#2

    9
    3
    10
    
首页