Quintomania Div 3 hard version

Revision en2, by i_am_not_special, 2024-11-05 05:20:31

You are given an array a of integers with n elements. You are allowed to rearrange the elements of the array in any order. Your task is to determine if it is possible to reorder the array such that for every i from 0 to n-2 (i.e., for all adjacent elements), the absolute difference between consecutive elements is either 5 or 7. That is, for all i such that 0 <= i < n — 1, you need to check if: abs(v[i] — v[i + 1]) = 5 or abs(v[i] — v[i+ 1]) = 7.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English i_am_not_special 2024-11-05 05:20:31 13
en1 English i_am_not_special 2024-11-05 05:19:32 485 Initial revision (published)