Submission #1121776

#TimeUsernameProblemLanguageResultExecution timeMemory
1121776vjudge1Calvinball championship (CEOI15_teams)C++17
10 / 100
2 ms592 KiB
#include <bits/stdc++.h>

// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define int long long
#define ll long long
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
const int oo = 1e18 + 9;
const int MAX = 1000 + 5, LOGMAX = 20, B = 441, MOD = 1e6 + 7;

int dp[2][MAX];

void solve(){
    int n; cin >> n;
    for(int i = 1; i <= n; i++) dp[0][i] = 1;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= n - i; j++){
            dp[1][j] = (dp[0][j] * j % MOD + dp[0][j + 1]) % MOD;
        }
        for(int j = 0; j <= n; j++){
            dp[0][j] = dp[1][j];
        }
    }
    cout << dp[0][0] << ' ';
}   

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
}
#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...