제출 #98380

#제출 시각아이디문제언어결과실행 시간메모리
98380someone_aaCalvinball championship (CEOI15_teams)C++17
10 / 100
104 ms66560 KiB
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 10100;
const ll mod = 1000007;
ll dp[maxn][maxn];
ll n, arr[maxn];

int main() {
    cin>>n;
    for(int i=1;i<=n;i++) {
        cin>>arr[i];
    }

    dp[1][1] = 1LL;
    for(int i=2;i<=n;i++) {
        for(int j=1;j<=n;j++) {
            dp[i][j] = j * dp[i-1][j] + dp[i-1][j-1];
            dp[i][j] %= mod;
        }
    }

    ll result = 0LL;
    for(int i=1;i<=n;i++) {
        result += dp[n][i];
        result %= mod;
    }
    cout<<result<<"\n";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...