Story of trying competitive programming 2

#I want to buy cakes and donuts and see if there is a pattern that makes a total of just $ N

N = int(input())
cake = 4
donuts = 7
ans = "No"

#If N is a multiple of the price of the cake or donut, then if you keep buying either the cake or the donut, you'll get $ N
if N % cake == 0 or N % donuts == 0:
    print('Yes')
    exit()

#If the above conditions are not met, full search
#The point is to divide the index
for i in range(N):
    #First, fix the index of the cake and change the number of donuts to check if the conditions are met.
    for j in range(N):
        if N == (i*cake + j*donuts):
            ans = "Yes"
            break
print(ans)

#I want to find out if a given integer fits in the multiplication table

N = int(input())
ans = 'No'

#Since it is a multiplication table, range(1,10)Can be achieved by trial of
for i in range(1,10):
    for j in range(1,10):
        if N == (i*j):
            ans = 'Yes'
            break
print(ans)

N = int(input())
ans = 'No'

def calculate(x,y):
  sample = x * y
  return sample

for i in range(1,10):
  for j in range(1,10):
    result = calculate(i,j)
    if result == N:
      ans = 'Yes'
print(ans)

#How many N coordinates in the D dimension have integer distances

import math
N, X = map(int, input().split())
#Get the given coordinates
l = [list(map(int, input().split())) for _ in range(N)]
count = 0


def test(x, y):
    d = 0
    #I want to calculate the axis distance of each coordinate for the number of X dimensions ex. X=In case of 2, the following calculation is performed between the X-axis and y-axis of each coordinate.
    for i in range(X):
        #Take the coordinates from l and compare them by the number of X dimensions. For example X=If it is 2, the loop ends by calculating the X axes first and then the Y axes.
        d += abs((x[i]-y[i]))**2
    #Returns the square root of d
    return math.sqrt(d)

#Dare to start from 1
for j in range(1, N):
    # j =If 1, range(1)And t=0 can be established
    for t in range(j):
        #How to retrieve the data of the multidimensional array is as follows
        result = test(l[j], l[t])
        if result == int(result):
            count += 1
print(count)



#How to extract numerical values ​​in the case of multidimensional array Application
# ex. num_list　= [[1, 2], [5, 5], [-2, 8]]When

# sample =  num_list[0] = [1,2]
# sample1 =  num_list[1] = [5, 5]
# sample[0] = 1　= num_list[0][0]
#You can take it out with the same theory below
# sample[1] = 2
# sample1[0] = 5
# sample1[1] = 5

#How many combinations make a triangle from the given side length

#module
import itertools

N = int(input())
l = list(map(int,input().split()))
count = 0
#Sort in ascending order
l.sort()
# itertools.combinations(iterable,int)Returns the combination of the number specified in the second argument in
for i in itertools.combinations(l,3):
    #The condition of the triangle is as follows because the total of the two sides is larger than the remaining one side, and this time the size of the three sides is different.
    if i[0] + i[1] > i[2] and i[0] != i[1] != i[2]:
        count += 1
print(count)

N = int(input())
num_list = list(map(int, input().split()))
count = 0
num_list.sort()

for i in itertools.combinations(num_list, 3):
  if i[0] + i[1] > i[2] and i[0] != i[1] != i[2]:
    count += 1
print(count)

#I want to add the digits of a given number to find the sum of the numbers that meet the conditions.

N,A,B = map(int,input().split())
new_list = []
#To represent the sum of the digits of a number, just keep adding the remainder after dividing by 10.
for i in range(1,N+1):
    #Save the number to try
    index = i
    ans = 0
    #Try until 0
    while i > 0:
        #Add the remainder
        ans += i % 10
        #Divide by 10
        i = i // 10
    #If the conditions are met, add the first saved number to the list
    if A <= ans <= B:
        new_list.append(index)
#Output list total
print(sum(new_list))

#I want to know the number of integers between A and B that are palindromic numbers.

A,B = map(int,input().split())
count = 0

#Convert integers to strings, list them, and compare them in reverse order.
for i in range(A,B+1):
    sample = str(i)
    sample2 = list(reversed(str(i)))
    sample2 = ''.join(sample2)
    if sample == sample2:
        count += 1
print(count)

N = int(input())
ans = N

#If the remainder of dividing N by 10 is 0, the answer you want is 10.
if N % 10 == 0:
    print(10)
    exit()
#Otherwise
for i in range(1,N):
    #The liver is that the sum of the integers A and B is N, which means that B= N -That it is A
    A = i
    B = N - i
    sum1 = 0
    sum2 = 0
    while A > 0:
        sum1 += A % 10
        A //= 10
    while B > 0:
        sum2 += B % 10
        B //= 10
    if ans > sum1 + sum2:
        ans = sum1 + sum2
print(ans)


#Alternative 1 Store the sum of the sums of each of A and B in a list and extract only the minimum value from it.

for i in range(1, N):
    A = i
    B = N - i
    result1 = 0
    result2 = 0
    while A > 0:
        result1 += A % 10
        A = A // 10
    while B > 0:
        result2 += B % 10
        B = B // 10
    sum = result1 + result2
    new_list.append(sum)
print(min(new_list))

#Alternative 2 From the point that when the sum of the integers A and B is N, the minimum sum of the sums of the A and B is equal to the sum of the N.

#Get numbers as strings
num = input()

ans = 0
for i in range(len(num)):
    #The integer obtained as a character string can be extracted as follows, so you can continue to add it.
    ans += int(num[i])

if ans == 1:
    print(10)
else:
    print(ans)

#I want to convert an integer to N-ary

#To convert an integer N to K-ary, you can pick up the remainder of N divided by K in order from the back, so you can count how many times you can do that.
N, K = map(int, input().split())
list = []
count = 0
while N > 0:
    count += 1
    #Not related to the problem, but if you need to keep a record of the remainder, keep it in the list
    list.append(str(N % K))
    N = N // K
print(count)
#The following is when you want to display the conversion result to 2, 8 and hexadecimal numbers
sample = int(''.join(list))
if K == 2:
    print(bin(sample))
elif K == 8:
    print(oct(sample))
elif K == 16:
    print(hex(sample))