• 1971 奇怪的函数

    Time Limit : 2000/1000 MS(Java/Others) | Memory Limit : 131072/65536 KB(Java/Others)

    Submits : 27 | Solved : 0

    Description

    给出一个数字n和k,请找出有多少个不同的整数m满足:
    1)	m<2^n
    2)	m>=0
    3)	|f(m,n)|<=k
    其中f(x,n)的定义如下:
    f(0,n)=n;
    f(x,n)=f([x/2],n),x为偶数
    f(x,n)=f([x/2],n)-2,x为奇数
    

    Input

    每组一行,分别给定n,k(1<=n<=62,2<=k<=5)

    Output

    每组一行,给出满足条件的m的个数

    Sample Input

    1 2
    4 3
    

    Sample Output

    2
    14
    

    HINT


    Source


    [ Top ] | [ Submit ] | [ Statistics ] | [ Standing ]