《CSP认证真题》2013-12-5 4.有趣的数
源代码:
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
int n;
int c[1010][1010];
int ans;
int main()
{
cin >> n;
for(int i = 0; i <= n; i++){
for(int j = 0; j <= i; j++){
if(!j){
c[i][j] = 1;
}else{
c[i][j] = (c[i - 1][j - 1] + c[i - 1][j]) % mod;
}
}
}
for(int k = 2; k <= n; k++){
ans = (ans + (ll)c[n - 1][k] * (k - 1) * (n - k - 1)) % mod;
}
cout << ans <<endl;
return 0;
}