[HackerEarth] There are N marbles in a line, numbered 1 through N from left to right. Count numbers of ways to remove exactly M marbles such that there are exactly C remaining connected components. A - 题解

暂无题解

题目信息
题号 P16834
标题 [HackerEarth] There are N marbles in a line, numbered 1 through N from left to right. Count numbers of ways to remove exactly M marbles such that there are exactly C remaining connected components. A
难度 提高
返回题目