A42 - Soccer
提出
code: python
n, k = map(int, input().split())
# pow(2, 300)
ab.sort()
# -->
# --->
# ------>
for i in range(n):
maxa, mina, maxb, minb = abi0, abi0, abi1, abi1 for j in range(i, n):
解答
code: python
# 整数の組 (a, b) が決まったときの、参加可能な生徒数を返す関数
def GetScore(a, b, A, B, K):
cnt = 0
for i in range(N):
if a <= Ai and Ai <= a + K and b <= Bi and Bi <= b+K: cnt += 1
return cnt
N, K = map(int, input().split())
for i in range(N):
Ai, Bi = map(int, input().split()) # (a, b) の組を全探索
Answer = 0
for a in range(1, 101):
for b in range(1, 101):
Score = GetScore(a, b, A, B, K)
Answer = max(Answer, Score)
print(Answer)