ModularInequality | Topcoder Archive

Problem Statement

You will be given a int[] A that contains N elements and an int P. Return the number of distinct integer values of X for which the following inequality is true:

|A₀ - X| + |A₁ - X| + ... + |A_N-1 - X| &#8804; P

Definition

Class:: ModularInequality
Method:: countSolutions
Parameters:: int[], int
Returns:: int
Method signature:: int countSolutions(int[] A, int P)
(be sure your method is public)

Constraints

A will contain between 1 and 50 elements, inclusive.
Each element of A will be between -1,000,000,000 and 1,000,000,000 inclusive.
P will be between 0 and 1,000,000,000 inclusive.

Examples

```
{1, 2, 3}
```
```
6
```
```
Returns: 5
```
The possible values for X are 0, 1, 2, 3 and 4.
```
{10, 30, 15, -1, 17}
```
```
42
```
```
Returns: 7
```
```
{0, 2, 3, -5, 10}
```
```
17
```
```
Returns: 0
```
```
{-693}
```
```
1265
```
```
Returns: 2531
```

{965, -938, -396, -142, 926, 31, -720}

Returns: 1781

This problem statement is the exclusive and proprietary property of Topcoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of Topcoder, Inc. is strictly prohibited. (c)2024, Topcoder, Inc. All rights reserved.