Find pairs
18% Success10203 Attempts20 Points1s Time Limit256MB Memory1024 KB Max Code
Given an array \(A\) of length \(N\). Find the number of ordered pairs \((i, j)\) which satisfy the given condition
- \((A[i] - A[j]) / (i - j) = 1\)
- \(A[i] - A[j]\) should be divisible by \(i-j\)
- \(i \neq j\)
Input format
- The first line contains an integer \(N\).
- The second line of each test case contains \(N\) space-separated integers, denoting the elements of array \(A\).
Output format
Print the number of ordered pairs (i, j) which satisfy the above condition in a new line.
Constraints
\(1 \le N \le 5 \times 10 ^ 5\)
\(1 \le A[i] \le 10^6\)
Examples
Input
3 1 2 3
Output
6
Explanation
For every pair \((i, j)\) in this array where \(i \neq j\), it satisfy the condition in the problem statement. Hence, the answer is 6.
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Loading Editor...
Results