ABC165 - Atcoder/Python精進のための解説メモ

k = int(input())
a, b = map(int, input().split())
ans = 'NG'
for i in range(a, b + 1):
    if i % k == 0:
        ans = 'OK'
print(ans)

n = int(input())
x = 100
ans = 0
while x < n:
    x = int(x * 1.01)
    ans += 1
print(ans)

import itertools
n, m, q = map(int, input().split())
abcds = [list(map(int, input().split())) for _ in range(q)]
aaa = range(1, m + 1)
ans = 0
for a in itertools.combinations_with_replacement(aaa, n):
    list(a).sort()
    tmp = 0
    for abcd in abcds:
        if a[abcd[1] - 1] - a[abcd[0] - 1] == abcd[2]:
            tmp += abcd[3]
    ans = max(ans, tmp)
print(ans)

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

def dfs(pos, aaa, m, abcds):
    if pos == len(aaa):
        score = 0
        for abcd in abcds:
            if aaa[abcd[1] - 1] - aaa[abcd[0] - 1] == abcd[2]:
                score += abcd[3]
        return score

    ans = 0
    low = 1 if pos == 0 else aaa[pos - 1]

    for i in range(low, m + 1):
        aaa[pos] = i
        ans = max(ans, dfs(pos + 1, aaa, m, abcds))
    return ans

print(dfs(0, [0] * n, m, abcds))

まだ解いていません