# 최소공배수, 최대공약수
a = list(map(int, input("input = ").split()[:4]))

max_, min_ = 0, 10**9

def GCD(a, b) :
    while b > 0 :
        a , b = b , a % b
    return a

def LCM(a, b) :
    return a * b / GCD(a, b)

for i in range(0, 4) :
    for j in range(i+1 , 4) :
        g = GCD(a[i],a[j])
        if max_ < g :
            max_ = g
        l = LCM(a[i],a[j])
        if min_ > l :
            min_ = l

print("output = ", max_, min_)

#숫자세기
arr=(input())

cnt=0
Max=0

for i in arr:
  if(i.isdigit()==True):
    cnt+=1
    
  elif(i.isdigit()==False):
    if(Max<cnt):
      Max=cnt
      cnt=0

    
if(Max<cnt):
  Max=cnt

print(Max)

#for 무한루프
l = [1]
for x in l:
    l.append(x + 1)
    print(x)

• 이론문제1
• 이론문제2