Vanya and Cards(CF结题报告)

                                                                                                              A. Vanya and Cards

                                                                                                                                time limit per test

                                                                                       1 second

                                                                             memory limit per test

                                                                                   256 megabytes

Vanya loves playing. He even has a special set of cards to play with. Each card has a single integer. The number on the card can be positive, negative and can even be equal to zero. The only limit is, the number on each card doesn't exceedx in the absolute value.

Natasha doesn't like when Vanya spends a long time playing, so she hid all of his cards. Vanya became sad and started looking for the cards but he only foundn of them. Vanya loves the balance, so he wants the sum of all numbers on found cards equal to zero. On the other hand, he got very tired of looking for cards. Help the boy and say what is the minimum number of cards does he need to find to make the sum equal to zero?

You can assume that initially Vanya had infinitely many cards with each integer number from - x tox.

Input

The first line contains two integers: n(1 ≤ n ≤ 1000) — the number of found cards andx(1 ≤ x ≤ 1000) — the maximum absolute value of the number on a card. The second line containsn space-separated integers — the numbers on found cards. It is guaranteed that the numbers do not exceedx in their absolute value.

Output

Print a single number — the answer to the problem.

Sample test(s)

Input

3 2-1 1 2

Output

1

Input

2 3-2 -2

Output

2

Note

In the first sample, Vanya needs to find a single card with number -2.

In the second sample, Vanya needs to find two cards with number 2. He can't find a single card with the required number as the numbers on the lost cards do not exceed 3 in their absolute value.

题意描述：

     本题大意为先输入n和x，n代表第二行输 入n个数，这些数的绝对值不能超过x，问还需要几个数能够使第二行总数的和为0.

解题思想：

    首先算下在不外加数的情况下，第二行数的总和。如果此时总和为0，当然最好，直接输出0就OK了。

但是，奇葩的数据总是有的····还很多。所以接下来判断sum大于0还是小于0。如果sum大于0，再判断

sum是否满足绝对值小于X这个条件，如果不满足，就用sum-x，使得sum值变小；如果sum小于0，同

样判断绝对值的情况，如果满足就sum+x，把sum增大。总之，就是为了让sum的值在x的绝对值内并且

解题代码：

#include <iostream>using namespace std;int s[100000];int main(){    int n,x;    while(cin >> n >> x)    {        int i,j;        for(i=0;i<n;i++)        {            cin >> s[i];        }        int sum=0;        for(i=0;i<n;i++)        {            sum+=s[i];        }        if(sum==0)            cout << "0" << endl;        else        {            int count=0;        while(sum)        {            int flag=0;            if(sum<0)            {                if(sum>=(-x) && sum<=x)                {                    count++;                    flag=1;                    break;                }                else                {                    sum+=x;                    count++;                }            }            else if(sum>0)            {                if(sum>=(-x) && sum<=x)                {                    count++;                    flag=1;                    break;                }                else                {                    sum-=x;                    count++;                }            }            if(flag)                break;        }        cout << count << endl;        }            }}