Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Angry Teacher
Description Mr. O'Cruel is teaching Math to ninth grade students. Students of course are very lazy, so they do not like to do their homework. On the other side, Mr. O'Cruel doesn't like lazy students.
Recently Andrew failed to do his homework again, so he was given a special task. If he doesn't do it, he will be expelled from his school. The task seems very easy, but it is very technical, so it would take a lot of time. Andrew is given a polynomial p(x) = a _{n}x^{n} + a_{n-1}x^{n-1} + . . . + a_{1}x + a_{0} with integer coefficients.
He must calculate the value of the polynomial for k successive integer numbers starting from l. Of course writing all these numbers would require too much paper. So as a proof of completing the task, for each number x from l to l + k - 1 Andrew is asked to provide the sum of squares of m last digits in decimal notation of p(x). Since Andrew is lazy, he doesn't want to do the task by himself. So he asks you to write the program that calculates the values requested. Input The first line of the input file contains n, l, k, and m (0 <= n <= 10, 0 <= l <= 10 ^{1000} , 1 <= k <= 1 000, 1 <= m <= 1 000).
The following n + 1 lines contain coefficients of the polynomial: a _{n} , a_{n-1} , . . . , a_{1} , a_{0} (0 <= a_{i} <= 10^{1000}). Output Output k lines --- for x from l to l + k - 1 output the sum of squares of last m digits of p(x). Sample Input 3 0 10 2 1 0 2 1 Sample Output 1 16 10 25 58 45 85 89 85 80 Source Northeastern Europe 2004, Northern Subregion |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator