내일은 알고리즘

https://school.programmers.co.kr/learn/courses/30/lessons/12912

def solution(a, b):
    return (a + b) * (abs(a - b) + 1) // 2

https://school.programmers.co.kr/learn/courses/30/lessons/12943

def solution(num):
    answer = 0
    
    while num != 1 and answer <= 500:
        if num % 2 == 0:
            num //= 2
        else:
            num = (num * 3) + 1
        
        answer += 1
        
    return answer if answer <= 500 else -1

https://school.programmers.co.kr/learn/courses/30/lessons/87389

def solution(n):
    for i in range(2, n):
        if n % i == 1:
            return i

https://school.programmers.co.kr/learn/courses/30/lessons/12954

def solution(x, n):
    answer = []
    d = x
    for i in range(n):
        answer.append(x)
        x += d
    return answer

https://school.programmers.co.kr/learn/courses/30/lessons/12925

def solution(s):
    answer = int(s)
    return answer

https://school.programmers.co.kr/learn/courses/30/lessons/12933

def solution(n):
    num = [0 for i in range(10)]
    
    for i in str(n):
        num[int(i)] += 1
    
    answer = ""
    for i in range(10):
        for j in range(num[9-i]):
            answer += str(9-i)
    
    return int(answer)

https://school.programmers.co.kr/learn/courses/30/lessons/12947

def solution(x):
    div = 0
    for i in str(x):
        div += int(i)
    
    return x % div == 0

https://school.programmers.co.kr/learn/courses/30/lessons/12916

def solution(s):
    p, y  = 0, 0
    s = s.lower()
    
    for i in s:
        if i == 'p':
            p += 1
        elif i == 'y':
            y += 1
    return p == y