Résoudre ABC167 A ~ C avec Python

s = input()
t = input()

n = len(t)
if s == t[:n-1]:
    print('Yes')
else:
    print('No')

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

if a >= k:  #tout k a
    print(k)
elif a + b >= k: #Si vous prenez c, il diminuera, alors prenez-le de b
    print(a)
else:
    n = k - (a + b)
    ans = a + -1 * n
    print(ans)

n, m, x = map(int,input().split())
ca = [list(map(int,input().split())) for _ in range(n)]

costs = []
for i in range(2 ** n):
    flag = True
    cost = 0
    algos = [0] * m
    op = [False] * n
    for j in range(n):
        if ((i >> j) & 1):
            op[n - j - 1] = True
    #print(op)
    for j in range(n):
        if op[j]:
            for k, u in enumerate(ca[j][1:]):
                algos[k] += u
            cost += ca[j][0]
    for j in algos:
        if j < x:
            flag = False
    if flag:
        costs.append(cost)

if len(costs) == 0:
    print(-1)
else:
    print(min(costs))

Recommended Posts