The problem statement asks to find out the Sum of f (a[i], a[j]) over all pairs in an array of n integers in such a way that 1 < = i < j < = n considering that we are provided an array of integers.
ຄໍາ ຖະແຫຼງກ່ຽວກັບບັນຫາຂໍໃຫ້ຄົ້ນຫາ Sum of f (a [i], a [j]) ເຫນືອ ທຸກຄູ່ໃນແຖວຂອງຕົວເລກ n ໃນວິທີການດັ່ງກ່າວທີ່ 1 <= i <j <= n ພິຈາລະນາວ່າພວກເຮົາໄດ້ຮັບ ອາເລຂອງເລກເຕັມ.