Type: Default 1000ms 256MiB

集合的划分

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

设S是一个具有n个元素的集合,$S=\\langle a\_1,a\_2,……,a\_n \\rangle$,现将S划分成k个满足下列条件的子集合$S\_1,S\_2,……,S\_k$ ,且满足:

1.$S\_i ≠ ∅$

2.$S\_i ∩ S\_j = ∅$            ($1≤i,j≤k,i≠j$)

3.$S\_1 ∪ S\_2 ∪ S\_3 ∪ … ∪ S\_k = S$

则称$S\_1,S\_2,……,S\_k$是集合S的一个划分。它相当于把S集合中的n个元素$a\_1 ,a\_2,……,a\_n$ 放入$k$个($0<k≤n<30$)无标号的盒子中,使得没有一个盒子为空。请你确定$n$个元素$a\_1 ,a\_2 ,……,a\_n$ 放入$k$个无标号盒子中去的划分数$S(n,k)$。

## Input Format

给出$n$和$k$。

## Output Format

$n$个元素$a\_1 ,a\_2 ,……,a\_n$ 放入$k$个无标号盒子中去的划分数$S(n,k)$。

```input1 10 6

```output1
22827

2026-5-16递归练习

Not Attended
Status
Done
Rule
XCPC
Problem
9
Start at
2026-5-16 13:30
End at
2026-5-16 16:30
Duration
3 hour(s)
Host
Partic.
4