Submission #971596

#TimeUsernameProblemLanguageResultExecution timeMemory
97159612345678Calvinball championship (CEOI15_teams)C++17
20 / 100
587 ms632 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const int nx=1e4+5, mod=1e6+7; ll n, x, dp[2][nx], res=1; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n; for (int i=1; i<=n; i++) cin>>x, dp[1][i]=1; for (int i=2; i<=n; i++) { int c=i%2, p=1-c; for (int j=1; j<=n; j++) dp[c][j]=(dp[c][j-1]*i+dp[p][j-1])%mod; res=(res+dp[c][n])%mod; } cout<<res; }
#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...