fork download
copy 
  1. def find_maximum_remainder(N, A, k):
  2.     evens = [x for x in A if x % 2 == 0]
  3.     odds = [x for x in A if x % 2 == 1]
  4.     max_rem = 0
  5.     for e in evens:
  6.         for o in odds:
  7.             rem = (e + o) % k
  8.             if rem > max_rem:
  9.                 max_rem = rem
  10.     print(max_rem)
  11.  
  12. T = int(input())
  13. for _ in range(T):
  14.     N = int(input())
  15.     A = list(map(int, input().split()))
  16.     k = int(input())
  17.     find_maximum_remainder(N, A, k)
  18.  
Success #stdin #stdout 0.09s 14164KB
comments (?)
stdin
copy 
1
6
1 2 3 4 5 6
4
stdout
copy 
3
https://ideone.com/nd17cC
language:
Python 3 (python  3.12)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!