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

d, t, s = map(int, input().split())
print('Yes' if d / s <= t else 'No')

s = input()
t = input()
len_s = len(s)
len_t = len(t)
ans = len_t
for i in range(len_s - len_t + 1):
    tmp = 0
    for j in range(len_t):
        if s[i + j] != t[j]:
            tmp += 1
    ans = min(ans, tmp)
print(ans)

n = int(input())
aaa = list(map(int, input().split()))
mod = 1000000007
acc = [0] * n
acc[n - 1] = aaa[n - 1]
ans = 0
for i in range(n - 2, 0, -1):
    acc[i] = (acc[i + 1] + aaa[i]) % mod
for i in range(n - 1):
    ans += aaa[i] * acc[i + 1] % mod
    ans %= mod
print(ans)

n = int(input())
aaa = list(map(int, input().split()))
mod = 1000000007
ans = 0
for a in aaa:
    ans += a
    ans %= mod
ans **= 2
ans %= mod
for a in aaa:
    ans -= a ** 2 % mod
    if ans < 0:
        ans += mod
ans *= pow(2, -1, mod)
ans %= mod
print(int(ans))

class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

n, m = map(int, input().split())
u = UnionFind(n)
for _ in range(m):
    a, b = map(int, input().split())
    u.union(a - 1, b - 1)
print(max(u.size(i) for i in range(n)))