Problem hidden
|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|

TREEK - Tree counting

Given two integers n and k. Count the number of different trees such that:

       - Tree has exactly n nodes.

       - Each node has 0 or 2 chlidren.

       - Tree's height is exactly k.

Note:

       - An empty tree is same as an empty tree

       - tree X is same as tree Y if and only if the left subtree of X is same as the left subtree of Y and the right subtree of X is same as the right subtree of Y.

Input

Two integers n and k, inclusive.

Output

The number of trees in modulo 9901.

Example

Input:
5 3

Output:
2

Constraint

0<n<1001; 0<k<501


Được gửi lên bởi:Nhung anh sao dem
Ngày:2013-09-05
Thời gian chạy:0.149s-0.224s
Giới hạn mã nguồn:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Ngôn ngữ cho phép:Tất cả ngoại trừ: GOSU PERL6 PYPY RUST SED
Nguồn bài:IOICAMP

hide comments
2013-09-06 02:20:32 anh chỉ yêu mình em....NTMH....
http://vn.spoj.com/problems/QBTREEK/
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.