Codeforces 639C (数学)

C. Bear and Polynomials

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Limak is a little polar bear. He doesn't have many toys and thus he often plays with polynomials.

He considers a polynomial valid if its degree is n and its coefficients are integers not exceeding k by the absolute value. More formally:

Let a0, a1, ..., an denote the coefficients, so . Then, a polynomial P(x) is valid if all the following conditions are satisfied:

• ai is integer for every i;
• |ai| ≤ k for every i;
• an ≠ 0.

Limak has recently got a valid polynomial P with coefficients a0, a1, a2, ..., an. He noticed that P(2) ≠ 0 and he wants to change it. He is going to change one coefficient to get a valid polynomial Q of degree n that Q(2) = 0. Count the number of ways to do so. You should count two ways as a distinct if coefficients of target polynoms differ.

Input

The first line contains two integers n and k (1 ≤ n ≤ 200 000, 1 ≤ k ≤ 109) — the degree of the polynomial and the limit for absolute values of coefficients.

The second line contains n + 1 integers a0, a1, ..., an (|ai| ≤ k, an ≠ 0) — describing a valid polynomial . It's guaranteed that P(2) ≠ 0.

Output

Print the number of ways to change one coefficient to get a valid polynomial Q that Q(2) = 0.

Examples

input

3 1000000000
10 -9 -3 5

output

3

input

3 12
10 -9 -3 5

output

2

input

2 20
14 -7 19

output

0

Note

In the first sample, we are given a polynomial P(x) = 10 - 9x - 3x2 + 5x3.

Limak can change one coefficient in three ways:

1. He can set a0 =  - 10. Then he would get Q(x) =  - 10 - 9x - 3x2 + 5x3 and indeed Q(2) =  - 10 - 18 - 12 + 40 = 0.
2. Or he can set a2 =  - 8. Then Q(x) = 10 - 9x - 8x2 + 5x3 and indeed Q(2) = 10 - 18 - 32 + 40 = 0.
3. Or he can set a1 =  - 19. Then Q(x) = 10 - 19x - 3x2 + 5x3 and indeed Q(2) = 10 - 38 - 12 + 40 = 0.

In the second sample, we are given the same polynomial. This time though, k is equal to 12 instead of 109. Two first of ways listed above are still valid but in the third way we would get |a1| > k what is not allowed. Thus, the answer is 2 this time.

题意:给出一个n次多项式,改变一个系数使得这个多项式在x=2时结果为0.

我们先观察怎样改变常数项才能使得多项式为0:先取出n次项系数,然后每次都乘以2加上前一项的系数,

一直到常数项后面的一项,假设这个时候结果是a,如果常数项需要改成b,那么有a*2+b=0,这个时候就可以

解出常数项.

从此可以得出一个启发,递归定义两个数组:

pr[i]=pr[i-1]/2+a[i],la[i]=la[i+1]*2+a[i],那么对于某一项常数假设需要改成ans[i],那么就有

(la[i]*2+ans[i])*2+pr[i-1] = 0;

对于pr这个数组,容易发现一旦不能被2整除,那么需要修改的系数必然出现在i之前;对于la这个数组,一旦

出现>=k的值,需要修改的数必然出现在i之后,因为如果la[i]>=k,根据递归定义la[i-1]=la[i]*2+a[i]>=2*k-k=k,

所以结果必然>=k不可能为0;

综上,用这两个数组搞出两个指针l,r,需要修改的系数项就在这两个下标之间寻找.

注意n次项不能改成0.

#include <bits/stdc++.h>
using namespace std;
#define maxn 211111

long long pr[maxn], la[maxn], a[maxn];
int n;
long long k;

int main () {
    //freopen ("in.txt", "r", stdin);
    while (scanf ("%d%lld", &n, &k) == 2) {
        memset (pr, 0, sizeof pr);
        memset (la, 0, sizeof la);
        n++;
        for (int i = 1; i <= n; i++)
            scanf ("%lld", &a[i]);
        int l = 1, r = n;
        for (int i = 1; i <= n; i++) {
            if (i == 1) {
                pr[i] = a[i];
            }
            else if (pr[i-1]%2 == 0) {
                l = i;
                pr[i] = pr[i-1]/2+a[i];
            }
            else
                break;
        }
        for (int i = n; i >= 1; i--) {
            if (i == n) {
                la[i] = a[i];
            }
            else if (abs(la[i+1]*2+a[i]) >= k) {
                la[i] = la[i+1]*2+a[i];
                break;
            }
            else { //cout << "i:" << i << endl;
                la[i] = la[i+1]*2+a[i];
                r = i;
            }
        }
        pr[0] = la[n+1] = 0;
        if (r > 1)
            r--;
        if (l < r) {
            printf ("0\n");
            continue;
        }
        int cnt = 0;
        for (int i = min (l, r); i <= max (l, r); i++) {
            long long ans = -1*pr[i-1]/2-2*la[i+1];
            if (pr[i-1]%2 != 0)
                continue;
            if (i == n && ans == 0)
                continue;
            if (abs (ans) <= k) {
                cnt++;
            }
        }
        printf ("%d\n", cnt);
    }
    return 0;
}