UVa 11718

From Algorithmist
Jump to: navigation, search
This is a stub or unfinished. Contribute by editing me.

sum = a[1] + a[2] + a[3] + ... + a[n-1] ;

res = ( sum * n^(k-1) * k ) % mod