Codeforces Round #235 (Div. 2) - c++编程基础

点击打开链接 A. Vanya and Cards time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output

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 exceed x 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 found n 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 to x.

Input

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

Output

Print a single number ― the answer to the problem.

Sample test(s) input

3 2
-1 1 2

output

input

2 3
-2 -2

output

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.

//15 ms	0 KB
#include
  
   
int main()
{
    int n,x;
    while(scanf("%d%d",&n,&x)!=EOF)
    {
        int sum=0,a;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a);
            sum+=a;
        }
        if(sum<0)sum=-sum;
        int ans=sum/x;
        if(sum%x)ans++;
        printf("%d\n",ans);
    }
    return 0;
}

B. Sereja and Contests time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output

Sereja is a coder and he likes to take part in Codesorfes rounds. However, Uzhland doesn't have good internet connection, so Sereja sometimes skips rounds.

Codesorfes has rounds of two types: Div1 (for advanced coders) and Div2 (for beginner coders). Two rounds, Div1 and Div2, can go simultaneously, (Div1 round cannot be held without Div2) in all other cases the rounds don't overlap in time. Each round has a unique identifier ― a positive integer. The rounds are sequentially (without gaps) numbered with identifiers by the starting time of the round. The identifiers of rounds that are run simultaneously are different by one, also the identifier of the Div1 round is always greater.

Sereja is a beginner coder, so he can take part only in rounds of Div2 type. At the moment he is taking part in a Div2 round, its identifier equals to x. Sereja remembers very well that he has taken part in exactly k rounds before this round. Also, he remembers all identifiers of the rounds he has taken part in and all identifiers of the rounds that went simultaneously with them. Sereja doesn't remember anything about the rounds he missed.

Sereja is wondering: what minimum and what maximum number of Div2 rounds could he have missed Help him find these two numbers.

Input

The first line contains two integers: x (1 ≤ x ≤ 4000) ― the round Sereja is taking part in today, and k (0 ≤ k

Next k lines contain the descriptions of the rounds that Sereja took part in before. If Sereja took part in one of two simultaneous rounds, the corresponding line looks like: "1 num2 num1" (where num2 is the identifier of this Div2 round, num1 is the identifier of the Div1round). It is guaranteed that num1 - num2 = 1. If Sereja took part in a usual

Codeforces Round #235 (Div. 2)(一)