# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99887 | zzee | Jarvis (COCI19_jarvis) | Cpython 3 | 1089 ms | 18340 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = []
for i in range(len(a)):
c = c+ [b[i]-a[i]]
i = 0
M = - 1000001
while len(c)>i:
x = c.count(c[i])
if x > M:
M = x
p = c[i]
for j in range(x):
c.remove(p)
i = i + 1
print(M)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |