ARC113

3 questions

https://gyazo.com/75df50274246be175b1b7ecc706b3d64

https://gyazo.com/c221fd9d347a749f911fa22717c94510

If A, B, and C all move in a range of 2*10**5, 8*10**15 will not make it in time.

But when A is 2, B moves only half the range, and once A and B are determined, the range of C is determined by calculation.

code:py

def main():

K = int(input())

ret = 0

for A in range(1, K + 1):

maxB = K // A

for B in range(1, maxB + 1):

maxC = maxB // B

ret += maxC

print(ret)

code:py

def main():

A, B, C = map(int, input().split())

for i in range(32):

doubling.append(

)

BC = 1

for i in range(32):

if C % 2:

BC %= 20

C //= 2

if BC == 0:

BC = 20

ret = (A % 10) ** BC

ret %= 10

print(ret)

code:py

def main():

S = input().strip().decode('ascii')

from collections import defaultdict

count = defaultdict(int)

ret = 0

prev = None

for i in reversed(range(len(S) - 2)):

d = (len(S) - 2) - i

ret += d

count = defaultdict(int)

p = len(S) - i

else:

prev = None

print(ret)

---