Count Pairs With a Sum

Count the pairs of different positions i < j in numbers where numbers[i] + numbers[j] equals target. Use two nested loops.

Implement count_pairs_with_sum(numbers, target).

Input

numbers: The list of integers. target: The sum to look for.

Output

Return the number of pairs.

Vincoli

0 ≤ length of numbers ≤ 500; -10,000 ≤ each number, target ≤ 10,000

Esempi

Input:
target = 6
numbers = [1, 5, 3, 3, 4]

Output atteso:
expected = 2

Input:
long long target = 6;
std::vector<long long> numbers = {1, 5, 3, 3, 4};

Output atteso:
long long expected = 2;

Input:
long target = 6;
long[] numbers = new long[] {1, 5, 3, 3, 4};

Output atteso:
long expected = 2;

Input:
target = 4
numbers = [2, 2, 2]

Output atteso:
expected = 3

Input:
long long target = 4;
std::vector<long long> numbers = {2, 2, 2};

Output atteso:
long long expected = 3;

Input:
long target = 4;
long[] numbers = new long[] {2, 2, 2};

Output atteso:
long expected = 3;

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

• UW TCSS 142 Introduction to Programming - master syllabus