Submission #70271762

---

Source Code Expand

import math
def gutyoku(C, D):
    cnt = 0
    for i in range(1, D + 1):
        S = int(str(C) + str(C + i))
        x = math.isqrt(S)
        if(x * x == S):
            # print(x, S, C, i, C + i)
            cnt += 1
    return cnt
def solve(C, D):
    cnt = 0
    y = math.isqrt(int(str(C) + str(C)))
    MAX_V = int(str(C) + str(C + D))
    # print(y)
    SC = str(C)
    while y * y <= MAX_V:
        y += 1
        S = str(y * y)
        is_ok = True
        print(y * y)
        print(MAX_V)
        for j in range(len(SC)):
            if(SC[j] != S[j]):
                is_ok = False
                break
        if(is_ok):
            print(S)
            Rest = S[len(SC):]
            if(Rest[0] == "0"):
                continue
            if(int(Rest) - C > D):
                return cnt
            if(int(Rest) - C >= 1):
                cnt += 1


def solve2(C, D):
    cnt = 0
    # SC = str(C)
    MIN_LEN = len(str(C + 1))
    MAX_LEN = len(str(C + D))
    for i in range(MIN_LEN, MAX_LEN + 1):
        if(i == MIN_LEN):
            y = math.isqrt(int(str(C) + str(C).zfill(i))) + 1
            # print(str(C) + str(C).zfill(i))
        else:
            y = math.isqrt(int(str(C) + "0" + "9" * (i - 1))) + 1
            # print(str(C) + "1" + "0" * (i - 1))
        # print(int(str(C) + str(C).zfill(i)))
        if(i == MAX_LEN):
            y2 = math.isqrt(int(str(C) + str(C + D))) + 1
            # print
            # print(int(str(C) + str(C + D)))
        else:
            y2 = math.isqrt(int(str(C) + "9" * i)) + 1
            # print(int(str(C) + "9" * i))

        # print(1353**2)
        # print(y, y2)
        # print(429 ** 2)
        cnt += (y2 - y)
        # while True:
        #     y += 1
            
        #     S = str(y * y)
        #     # print(S)
        #     is_ok = True
        #     for j in range(len(SC)):
        #         if(SC[j] != S[j]):
        #             # print(S)
        #             is_ok = False
        #             break
        #     if(is_ok):
        #         # print(S)
        #         Rest = S[len(SC):]
        #         if(Rest[0] == "0"):
        #             continue
        #         # print(Rest, D)
        #         if(int(Rest) - C > D):
        #             return cnt
        #         if(int(Rest) - C >= 1):
        #             cnt += 1
        #     else:
        #         break
        # break
    return cnt

# import random
# random.seed(154)
# while True:
#     C = random.randint(1, 100)
#     D = random.randint(1, 10)
#     print()
#     ans1 = gutyoku(C, D)
#     ans2 = solve2(C, D)
#     if(ans1 != ans2):
#         print(C, D)
#         print(ans1, ans2)
#         break

T = int(input())
for _ in range(T):
    C, D = map(int, input().split())
    print(solve2(C, D))

Submission Info

Judge Result