30 lines
458 B
Python
30 lines
458 B
Python
DIGS = "0123456789ABCDEFGH"
|
|
|
|
|
|
def int2base(n, base):
|
|
if n == 0:
|
|
return DIGS[0]
|
|
|
|
digits = []
|
|
while n:
|
|
digits.append(DIGS[n % base])
|
|
n = n // base
|
|
|
|
digits.reverse()
|
|
return "".join(digits)
|
|
|
|
|
|
def SSDN(b, n):
|
|
n = int2base(n, b)
|
|
ans = 0
|
|
for x in n:
|
|
ans += DIGS.index(x) ** 2
|
|
return ans
|
|
|
|
|
|
p = int(input())
|
|
|
|
for _ in range(p):
|
|
k, b, n = map(int, input().split())
|
|
print(f"{k} {SSDN(b, n)}")
|