Given a 0-indexed integer array nums of size n and two integers lower and upper, return the number of fair pairs.

You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively. You are also given a positive integer k.A pair (i, j) is called good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).Return the total number of good pairs. Example 1:Input: nums1 = [1,3,4], nums2 = [1,3,4], k = 1Output: 5Explanation:The 5 good pairs are (0, 0), (1, 0), (1, 1), (2, 0), and (2, 2).Example 2:Input: nums1 = [1,2,4,12], nums2 = [2,4], k = 3Output: 2Explanation:The 2 good pairs are (3, 0) and (3, 1). Constraints:1 <= n, m <= 1051 <= nums1[i], nums2[j] <= 1061 <= k <= 103C++ 1class Solution {2public:3    long long numberOfPairs(vector<int>& nums1, vector<int>& nums2, int k) {4        5   }6};

You are given two 0-indexed integer arrays nums1 and nums2 of sizes n and m, respectively.Consider calculating the following values:The number of indices i such that 0 <= i < n and nums1[i] occurs at least once in nums2.The number of indices i such that 0 <= i < m and nums2[i] occurs at least once in nums1.Return an integer array answer of size 2 containing the two values in the above order.

You are given 2 arrays A and B of same size N. A pair is said to be a valid if and only if i < j, A[i] == B[j] and A[j] == B[i]. You have to count total number of valid pairs.Input FormatFirst line of input contains T - number of test cases. First line of each test case contains N - size of the array. The second and third line of each test case contains N integers - elements of the array A and B.Output FormatFor each test case, print the count of number of valid pairs, separated by newline.Constraints30 points1 <= N <= 10370 points1 <= N <= 105General Constraints1 <= T <= 1000 <= A[i], B[i] <= 109ExampleInput231 2 33 2 151 3 7 9 93 1 9 7 7Output13ExplanationTest Case 1:There is only one valid pair - (0, 2). This is because A[0] == B[2] and A[2] == B[0].Test Case 2:There are 3 valid pairs - (0, 1), (2, 3), (2, 4). For example (0, 1) is valid because A[0] == B[1] and A[1] == B[0].

Consider an array of integers, . Find and print the total number of pairs such that where .Input FormatThe first line contains an integer, , denoting the number of elements in the array.The second line consists of space-separated integers describing the respective values of .ConstraintsScoring for of the test cases. for of the test cases. for of the test cases.Output FormatPrint a long integer denoting the total number pairs satisfying where .Sample Input5 1 1 2 4 2Sample Output8ExplanationThere are eight pairs of indices satisfying the given criteria: , , , , , , , and . Thus, we print as our answer.Contest ends in 2 hoursSubmissions: 43Max Score: 10Difficulty: AdvancedRate This Challenge: More Python 31#!/bin/python32​3import math4import os5import random6import re7import sys8​9#10# Complete the 'solve' function below.11#12# The function is expected to return a LONG_INTEGER.13# The function accepts INTEGER_ARRAY arr as parameter.14#15​16def solve(arr):17    # Write your code here18    19if __name__ == '__main__':20    fptr = open(os.environ['OUTPUT_PATH'], 'w')21​22    arr_count = int(input().strip())23​24    arr = list(map(int, input().rstrip().split()))25​26    result = solve(arr)27​28    fptr.write(str(result) + '\n')29​30    fptr.close()31​

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.Merge nums1 and nums2 into a single array sorted in non-decreasing order.The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n. Example 1:Input: nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3Output: [1,2,2,3,5,6]Explanation: The arrays we are merging are [1,2,3] and [2,5,6].The result of the merge is [1,2,2,3,5,6] with the underlined elements coming from nums1.Example 2:Input: nums1 = [1], m = 1, nums2 = [], n = 0Output: [1]Explanation: The arrays we are merging are [1] and [].The result of the merge is [1].Example 3:Input: nums1 = [0], m = 0, nums2 = [1], n = 1Output: [1]Explanation: The arrays we are merging are [] and [1].The result of the merge is [1].Note that because m = 0, there are no elements in nums1. The 0 is only there to ensure the merge result can fit in nums1. Constraints:nums1.length == m + nnums2.length == n0 <= m, n <= 2001 <= m + n <= 200-109 <= nums1[i], nums2[j] <= 109 Follow up: Can you come up with an algorithm that runs in O(m + n) time?