|Online Judge||Problem Set||Authors||Online Contests||User|
Alternating Sum of Digits
Any integer number can be written as a sequence of digits in a specific system of base. For example, 5 in decimal based system can be written as 101 in binary based system. By writting down every number from 1 to N in system of base K one by one, we obtain a long sequence of digits. Your task is to calculate the alternating sum of digits, i.e. the difference between the sum of digits with odd index in the sequence and the sum of ones with even index.
For example, the sequence is 11011100101 and the alternating sum is 1 (the result of +1-1+0-1+1-1+0-0+1-0+1) given K = 2 and N = 101.
K (1 < K ≤ 10) and N ( ≤ 1020, in the system of base K)
The alternating sum. You should print it in decimal based system.
It is safe to use 64-bit signed integral arithmetic.
POJ Founder Monthly Contest – 2008.03.16, ShiningMoon
[Submit] [Go Back] [Status] [Discuss]
Home Page Go Back To top
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator