不是说可以随便水 吗

hesenwen

# 计算一个数的各位数字之和
def digit_sum(n, base):
    sum = 0
    while n > 0:
        sum += n % base
        n //= base
    return sum

t = int(input())
for i in range(t):
    n = int(input())
    if digit_sum(n, 10) == digit_sum(n, 16) == digit_sum(n, 12):
        print(str(n) + " is a Sky Number.")
    else:
        print(str(n) + " is not a Sky Number.")

hesenwen

# 计算一个数的各位数字之和
def digit_sum(n, base):
    sum = 0
    while n > 0:
        sum += n % base
        n //= base
    return sum

t = int(input())
for i in range(t):
    n = int(input())
    if digit_sum(n, 10) == digit_sum(n, 16) == digit_sum(n, 12):
        print(str(n) + " is a Sky Number.")
    else:
        print(str(n) + " is not a Sky Number.")

hesenwen

# 计算一个数的各位数字之和
def digit_sum(n, base):
    sum = 0
    while n > 0:
        sum += n % base
        n //= base
    return sum

t = int(input())
for i in range(t):
    n = int(input())
    if digit_sum(n, 10) == digit_sum(n, 16) == digit_sum(n, 12):
        print(str(n) + " is a Sky Number.")
    else:
        print(str(n) + " is not a Sky Number.")

hesenwen

# 计算一个数的各位数字之和
def digit_sum(n, base):
    sum = 0
    while n > 0:
        sum += n % base
        n //= base
    return sum

t = int(input())
for i in range(t):
    n = int(input())
    if digit_sum(n, 10) == digit_sum(n, 16) == digit_sum(n, 12):
        print(str(n) + " is a Sky Number.")
    else:
        print(str(n) + " is not a Sky Number.")

hesenwen

# 计算一个数的各位数字之和
def digit_sum(n, base):
    sum = 0
    while n > 0:
        sum += n % base
        n //= base
    return sum

t = int(input())
for i in range(t):
    n = int(input())
    if digit_sum(n, 10) == digit_sum(n, 16) == digit_sum(n, 12):
        print(str(n) + " is a Sky Number.")
    else:
        print(str(n) + " is not a Sky Number.")

hesenwen

def digit_sum(n, base):
    sum = 0
    while n > 0:
        sum += n % base
        n //= base
    return sum

t = int(input())
for i in range(t):
    n = int(input())
    if digit_sum(n, 10) == digit_sum(n, 16) == digit_sum(n, 12):
        print(str(n) + " is a Sky Number.")
    else:
        print(str(n) + " is not a Sky Number.")

hesenwen

def divisor_sum(n):
    sum = 1
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            sum += i
            if i != n // i:
                sum += n // i
    return sum

t = int(input())
for i in range(t):
    a, b = map(int, input().split())
    if divisor_sum(a) == b and divisor_sum(b) == a:
        print("YES")
    else:
        print("NO")

hesenwen

def divisor_sum(n):
    sum = 1
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            sum += i
            if i != n // i:
                sum += n // i
    return sum

t = int(input())
for i in range(t):
    a, b = map(int, input().split())
    if divisor_sum(a) == b and divisor_sum(b) == a:
        print("YES")
    else:
        print("NO")

hesenwen

def divisor_sum(n):
    sum = 1
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            sum += i
            if i != n // i:
                sum += n // i
    return sum

t = int(input())
for i in range(t):
    a, b = map(int, input().split())
    if divisor_sum(a) == b and divisor_sum(b) == a:
        print("YES")
    else:
        print("NO")

hesenwen

def is_perfect_number(n):
    sum = 0
    for i in range(1, n):
        if n % i == 0:
            sum += i
    return sum == n

for i in range(1, 1001):
    if is_perfect_number(i):
        print(str(i) + " its factors are ", end="")
        for j in range(1, i):
            if i % j == 0:
                print(j, end=" ")
        print()