# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
244560 | SomeoneUnknown | Calvinball championship (CEOI15_teams) | C++14 | 60 ms | 65540 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
scanf("%lld", &n);
long long dp[n+1][n+1]; //ways to fill A slots with a previously used B
for(long long i = 0; i <= n; i++){
dp[0][i] = 1;
}
for(long long i = 1; i <= n; i++){
for(long long j = 0; j <= n-i; j++){
dp[i][j] = dp[i-1][j+1] + (j * dp[i-1][j]);
dp[i][j] %= 1000007;
}
}
long long tal = 1;
long long hsf = 0;
for(long long i = 1; i <= n; i++){
long long x;
scanf("%lld", &x);
tal += dp[n-i][hsf] * (x-1);
tal %= 1000007;
hsf = max(hsf, x);
}
printf("%lld", tal);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |