Определить количество пар удовлетворяющих заданным условиям

f = open('17 (1).txt')
a = list(map(int, f.readlines()))
s = 0
m = -1
for i in range(len(a) - 1):
    for j in range(i + 1, len(a)):
        if a[i] - a[j] % 2 == 0 and a[i] % 19 == 0 or a[j] % 19 == 0:
            s += 1
            m = max(m, a[i] + a[j])
print(s, m)

if (a[i] - a[j]) % 2 == 0

f = open('17 (1).txt')
a = list(map(int, f.readlines()))
s = 0
m = -1
for i in range(len(a) - 1):
    for j in range(i + 1, len(a)):
        if (a[i] - a[j]) % 2 == 0 and (a[i] % 19 == 0 or a[j] % 19 == 0):
            s += 1
            m = max(m, a[i] + a[j])
print(s, m)

f = open('17 (1).txt')
a = list(map(int, f.readlines()))
s = 0
m = -1
for i in range(len(a) - 1):
    for j in range(i + 1, len(a)):
        if (a[i] % 160 != a[j] % 160) and (a[i] % 7 == 0 or a[j] % 7 == 0):
            s += 1
            m = max(m, a[i] + a[j])
print(s, m)

max_by_7 = [0]*160
max_not_by_7 = [0]*160
div_by_7 = [0]*160
div_not_by_7 = [0]*160
with open('17.txt') as f:
    nums = f.read()
#nums = [int(input()) for i in range(1000)]
for num in nums.splitlines():
    num = int(num)
    if num%7:
        div_not_by_7[num%160] += 1
        max_not_by_7[num%160] = max(max_not_by_7[num%160], num)
    else:
        div_by_7[num%160] += 1
        max_by_7[num%160] = max(max_by_7[num%160], num)
 
cnt = 0
for i in range(159):
    cnt_i = div_not_by_7[i] + div_by_7[i]
 
    for j in range(i+1, 160):
        cnt_0 = div_not_by_7[i] * div_not_by_7[j]
        cnt_j = div_not_by_7[j] + div_by_7[j]
        cnt += cnt_i*cnt_j - cnt_0
 
pair = [el1 + el2 for i, el1 in enumerate(max_by_7)
         for j, el2 in enumerate(max_not_by_7) if i != j]
 
print(cnt, max(pair))