[PYTHON] Story of trying competitive programming Part 1

N = int(input())
b,c = map(int,input().split())
S = input()
sum = N + b + c

# .If you use format, what you set in the argument{}Can be replaced with where you put
print("{} {}".format(sum, S))

a,b = map(int,input().split())

#Whether the even number judgment is 0 when the remainder divided by 0 is 0. I often come out but often forget
def Check(A,B):
  result = A * B
  if result % 2 == 0:
    print('Even')
  elif result % 2 != 0:
    print('Odd')

Check(a,b)

#Break down characters one by one into a list
l = list(input())
#Convert elements in list to int type
l= [int(s) for s in l]
count = 0

for i in l:
  if i == 1:
    count += 1
print(count)

N = int(input())
num_list = list(map(int,input().split()))
count = 0
bool = True
#It is important to decide which loop to end at what timing while combining while and for.
while bool:
  for i in range(N):
    if num_list[i] % 2 != 0:
      print(count)
    #This time with while num_1 element in list/2 I want to continue, so I stop while itself
      bool = False
    else:
      num_list[i] = num_list[i] // 2
  count += 1

#How many ways are there to choose some coins and make the total amount just X Yen?

A = int(input())
B = int(input())
C = int(input())
X = int(input())
#initial value
count = 0
countA = 0
countB = 0
countC = 0

# R3
while countA <= A:
    countB = 0
    # R2
    while countB <= B:
        countC = 0
        # R1
        while countC <= C:
            if(500*countA + 100*countB + 50*countC == X):
                count += 1
            countC += 1
        countB += 1
    countA += 1
print(count)

#Nested loops are processed from the inside
#In other words, processing starts from the position of R1 first, and when R1 ends, countB+=1 is performed and R2 processing starts. At this time countC=Since it is initialized to 0, the processing of R1 is also performed again.(At this time countB=1)
#Similarly, when R2 ends, countA+=1 is performed and R3 processing starts. At this time, countA=1 and countB=0 and countB<=Since it is B, count C= 0

#Receive input in half-width space increments with int
N = map(int,input().split())
#Convert the received N to a string and make it a list
l = [str(i) for i in N]
#Combine strings in a list
num = "".join(l)

if int(num) % 4 == 0:
  print('YES')
elif int(num) % 4 != 0:
  print('NO')

N = int(input())
A = int(input())

if N % 500 <= A:
  print('Yes')
else:
  print('No')

import math
N = int(input())

print(math.ceil(N / 2))

S = input()
#The string is list()Can be decomposed into characters one by one
l = list(S)
count = 0

for i in l:
  if i == 'o':
    count += 1
sum = 700 + (100*count)
print(sum)

S = input()
l = list(S)

l[0] = '2'
l[1] = '0'
l[2] = '1'
l[3] = '8'

result = ''.join(l)
print(result)

S = input()
l = list(S)
#Number of characters between the beginning and the end=word count- 2
num = len(l) - 2
print(l[0] + str(num) + l[-1])

s = input()
t = input()

l_s = list(s)
l_t = list(t)

#L in dictionary order_s < l_I want to know if t holds → l_s dictionary order minimum(ascending order) < l_Maximum in dictionary order of t(descending order)Just judge if
#sorted creates a new array and sorts it while keeping the original array, reverse=True in descending order
sample1 = sorted(l_s)
sample2 = sorted(l_t, reverse=True)

if sample1 < sample2:
  print('Yes')
else:
  print('No')

N = int(input())
list = []
#Since the input value is 1 or more, set the initial value to 1 or more.
sample = 1
count1 = 0

#I want to put the numerical value from 1 to the input value in the list from the condition
for i in range(N):
  list.append(i+1)

#Search processing with the created list
for l in list:
    #Create a new initial value
    p_l = l
    count2 = 0
    #Process to keep dividing
    while l % 2 == 0 :
        l = l // 2
        count2 += 1
    #When while is finished, select whether to update the initial value at the beginning with conditional branching
    if count2 > count1:
        count1 = count2
        sample = p_l
print(sample)

N = int(input())
l = list(map(int,input().split()))
count = 0
sample1 = 1

#Repeat as many times as there are elements
for i in range(N):
    #Then apply l to the for statement
    for j in l:
        #Since the loop is processed from the inside, j=until l goes around l[i]Is fixed
        sample2 = abs(l[i] - j)
        if sample2 > sample1:
            sample1 = sample2
print(sample1)

#When not using for
N = int(input())
l = list(map(int,input().split()))

#Maximum absolute value=Subtraction between maximum and minimum of list elements
l_max = max(l)
l_min = min(l)

abs = abs(l_max - l_min)

print(abs)

N = int(input())
average,temp = map(int, input().split())
elevation = list(map(int, input().split()))
newlist = []

#Function for calculating average temperature
def calcurate_temp(ele):
    result = average - (ele*0.006)
    return result
#Calculate the average temperature from the data of each given altitude, calculate the absolute value with the temperature, and put it in the list.
for i in range(N):
    t = calcurate_temp(elevation[i])
    sample = abs(temp - t)
    newlist.append(sample)
    pass
# .index()You can get the specified index of the list with
#This time it's close to the temperature=I want the index with the smallest absolute value, so it looks like this:
#Also, since the index starts from 0+1 returns what you did
ans = int(newlist.index(min(newlist))) + 1
print(ans)

#A pattern to write simply without creating a function
N = int(input())
T,A = map(int,input().split())
l = list(map(int,input().split()))
new_list = []

for i in range(N):
    sample = l[i]
    test = T - (sample*0.006)
    abs_sample = abs(A - test)
    new_list.append(abs_sample)
print(new_list.index(min((new_list))) + 1)

S = input()
l = list(S)
new_list = []

for i in range(len(l)):
    #Since the index starts from 0, the odd number is the character when the index becomes even.
    if i % 2 == 0:
        new_list.append(l[i])
ans = "".join(new_list)
print(ans)

S = input()
l = list(S)
new_list = []
#If there are multiple applicable characters, set the initial value that does not meet the conditions because you want to supplement only at the beginning.
first_a = 200001
last_z = 0

for i in range(len(l)):
    if l[i] == "A":
        a_index = i
        if first_a >= a_index:
            first_a = a_index
    if l[i] == "Z":
        z_index = i
        if last_z <= z_index:
            last_z = z_index
for j in range(first_a - 1, last_z):
    new_list.append(l[j])
print(len(new_list))

N, X = map(int,input().split())
l = [int(input()) for _ in range(N)]
#Make at least one, so add up the elements in the list
premise = sum(l)
#Subtract the premise from X to get the remainder of the material
rest = X - premise
#Then make as much as possible from the remaining ingredients=Calculate how much you can make a product that consumes less material and add prerequisites
print((rest // min(l)) + N)

#When using the sort function
N,X = map(int,input().split())
list = [int(input()) for _ in range(N)]
list_sum = sum(list)
sample = X - list_sum
#I want to find the smallest, so I sort the elements of the list in ascending order
list.sort()
 
print((sample // list[0]) + N)