codeforces 569 D. Symmetric and Transitive (bell数)

最新推荐文章于 2019-08-11 20:31:01 发布

原创最新推荐文章于 2019-08-11 20:31:01 发布 · 667 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#algorithm #组合数学

组合数学专栏收录该内容

31 篇文章

订阅专栏

本文探讨了生成包含特定属性的非等价关系的数量，并提供了计算方法及示例，深入理解数学与计算机科学之间的联系。

Little Johnny has recently learned about set theory. Now he is studying binary relations. You've probably heard the term "equivalence relation". These relations are very important in many areas of mathematics. For example, the equality of the two numbers is an equivalence relation.

A set ρ of pairs (a, b) of elements of some set A is called a binary relation on set A. For two elements a and b of the set A we say that they are in relation ρ, if pair $\text{[math]}$ , in this case we use a notation $\text{[math]}$ .

Binary relation is equivalence relation, if:

It is reflexive (for any a it is true that $\text{[math]}$ );
It is symmetric (for any a, b it is true that if $\text{[math]}$ , then $\text{[math]}$ );
It is transitive (if $\text{[math]}$ and $\text{[math]}$ , than $\text{[math]}$ ).

Little Johnny is not completely a fool and he noticed that the first condition is not necessary! Here is his "proof":

Take any two elements, a and b. If $\text{[math]}$ , then $\text{[math]}$ (according to property (2)), which means $\text{[math]}$ (according to property (3)).

It's very simple, isn't it? However, you noticed that Johnny's "proof" is wrong, and decided to show him a lot of examples that prove him wrong.

Here's your task: count the number of binary relations over a set of size n such that they are symmetric, transitive, but not an equivalence relations (i.e. they are not reflexive).

Since their number may be very large (not 0, according to Little Johnny), print the remainder of integer division of this number by 109 + 7.

Input

A single line contains a single integer n (1 ≤ n ≤ 4000).

Output

In a single line print the answer to the problem modulo 109 + 7.

Sample test(s)

input
1

output
1

input
2

output
3

input
3

output
10

bell数

#include <iostream>
#include <cstdio>
#include <map>
using namespace std;

#define LL __int64

const int MOD = 1000000007;

LL T[4005],B[4005];
void get_bell(int n,int mod){
    B[0]=1;
    B[1]=1;
    T[0]=1;
    for(int i=2;i<=n;++i){
        T[i-1]=B[i-1];
        for(int j=i-2;j>=0;--j)
            T[j]=(T[j]+T[j+1])%mod;
        B[i]=T[0];
    }
}

int main() {
	get_bell(4001, MOD);
	int n;
	cin>>n;
	LL a = B[n + 1];
	LL b = B[n];
	cout<<(a - b + MOD) % MOD<<endl;
	return 0;
}