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

a = int(input())
print(a + a ** 2 + a ** 3)

s = input()
t = input()
ans = 0
for s, t in zip(s, t):
    if s != t:
        ans += 1
print(ans)

n, m, k = map(int, input().split())
aaa = list(map(int, input().split()))
bbb = list(map(int, input().split()))
t, ans = sum(bbb), 0
j = m
for i in range(n + 1):
    while j > 0 and t > k:
        j -= 1
        t -= bbb[j]
    if t > k:
        break
    ans = max(ans, i + j)
    if i == n:
        break
    t += aaa[i]
print(ans)

import bisect
n, m, k = map(int, input().split())
aaa = list(map(int, input().split()))
bbb = list(map(int, input().split()))
sum_a = [0] * (n + 1)
sum_b = [0] * (m + 1)

for i in range(n):
    sum_a[i + 1] = sum_a[i] + aaa[i]

for j in range(m):
    sum_b[j + 1] = sum_b[j] + bbb[j]

ans = 0
for i in range(n + 1):
    if sum_a[i] > k:
        break
    tmp = bisect.bisect_right(sum_b, k - sum_a[i])
    ans = max(ans, i + tmp - 1)

print(ans)

まだ解いてません