SPOJ AMR10F Cookies Piles

AMR10F – Cookies Piles

no tags 

 

The kids in my son’s kindergarten made Christmas cookies with their teacher, and piled them up in columns.  They then arranged the columns so that the tops of the columns, going from shortest to tallest, were in a nice straight ramp.  The cookies were all of uniform size.  Given that there were A cookies in the shortest pile, that the difference in height between any two adjacent piles was D cookies, and that there were N piles, can you write a program to figure out how many cookies there were in total? 
 
INPUT 
The first line contains the number of test cases T. T lines follow, one corresponding to each test case, containing 3 integers : N, A and D. 
 
OUTPUT
Output T lines, each line containing the required answer for the corresponding test case. 
 
CONSTRAINTS 
T <= 100 
1 <= N, A, D <=100 
 
SAMPLE INPUT 

1 1 1 
3 5 6 
2 1 2 
 
SAMPLE OUTPUT 

33 

 
EXPLANATION 
In the second test case the sequence is: 5, 11, 17 whose sum is 33.

 

水.

作者: CrazyKK

ex-ACMer@hust,stackoverflow-engineer@sensetime

说点什么

您将是第一位评论人!

提醒
wpDiscuz