HW1_CEN109_2017 |
Start: Jan.20.2018 at 11:48:29 AM
Finish: Jan.28.2018 at 05:00:15 AM
The contest is finished!
• Contest scoreboard
|
Feedback | If you notice incorrect translations in Contester, please let author know.
|
|
Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb. bfs.
We use the integers a, b, and n to create the following series:
(a +20 *b),( a+ 20 *b +21 *b),..., (a+20 *b+21 *b+...+2n-1 *b)
You are given the querie in the form of a,b , and n. For this query, print the series corresponding to the given a,b , and n values as a single line of space-separated integers.
Input Format
The line contains three space-separated integers describing the respective a,b , and n values for that query.
Constraints
- 0<=a<=150
- 0<=b<=120
- 0<=n<=25
Output Format
For the given query, print the corresponding series on a line. The series must be printed in order as a single line of space-separated integers.
Sample Input |
0 2 10 |
Sample Output |
2 6 14 30 62 126 254 510 1022 2046 |
Для отправки решений необходимо выполнить вход.
|