#3867. C++-树-二叉树，假设有一颗h层的完全二叉树，该树最少包含多少个节点
-
ID: 3867
Type: Default
1000ms
256MiB
Tried: 5
Accepted: 3
Difficulty: 10
Uploaded By:
编创小匠 (paifuture)
C++-树-二叉树，假设有一颗h层的完全二叉树，该树最少包含多少个节点
Background
Description
二叉树，假设有一颗h（1<=h<=50）层的完全二叉树，该树最少包含多少个节点
Format
Input
Output
Samples
10
512
Limitation
1s, 1024KiB for each test case.