20250227(개학 전 마지막 소스 코드)

# import sys
# sys.setrecursionlimit(100000)
# def check(m):
#     global b,ans,s
#     t=int(0)
#     for i in range(m):
#         t=t+b[i]
#     if t==s:
#         ans=ans+1
# def dfs(c,m,l):
#     global a,b,n
#     if c==m:
#         check(m)
#         return
#     for i in range(l+1,n):
#         b.append(a[i])
#         dfs(c+1,m,i)
#         b.pop()
# n,s=map(int,input().split())
# ans=int(0)
# a=list(map(int,input().split()))
# b=[]
# for i in range(n):
#     dfs(0,i+1,-1)
# print(ans)
# import sys
# sys.setrecursionlimit(100)
# def check(m):
#     global b,ans,s
#     t=int(0)
#     for i in range(m):
#         t=t+b[i]
#     if t<s and ans<t:
#         ans=t
# def dfs(c,m,l):
#     global a,b,n
#     if c==m:
#         check(m)
#         return
#     for i in range(l+1,n):
#         b.append(a[i])
#         dfs(c+1,m,i)
#         b.pop()
# s=int(input())
# n=int(input())
# ans=int(0)
# a=list(map(int,input().split()))
# b=[]
# for i in range(n):
#     dfs(0,i+1,-1)
# print(ans)
# import math
# n,k=map(int,input().split())
# print(math.comb(n,k))
# import sys
# sys.setrecursionlimit(100)
# def dfs(c,l):
#     global s,ans,n
#     if c==s:
#         ans=ans+1
#         return
#     elif l==n:
#         return
#     for i in range(l+2,n):
#         dfs(c+1,i)
# n,s=map(int,input().split())
# ans=int(0)
# dfs(0,-2)
# print(ans)