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;
#define ll long long
#define ii pair<ll,ll>
#define endl '\n'
const ll inf=1e15;
const ll mod=1e6+7;
const ll maxn=15;
vector<ll> dp[maxn][maxn];
void solve(ll digit, ll rem){
if (dp[digit][rem].size()) return;
if (dp[digit][rem-1].empty()){
solve(digit,rem-1);
}
for (auto u:dp[digit][rem-1]){
for (int i=0;i<u;i++){
dp[digit][rem].push_back(u);
}
dp[digit][rem].push_back(u+1);
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n,ele,ans=0;
for (int i=1;i<=15;i++){
dp[i][0].emplace_back(i);
}
cin>>n;
for (int i=1;i<=n;i++){
cin>>ele;
for (int j=1;j<ele;j++){
solve(j,n-i);
ans+=dp[j][n-i].size();
ans%=mod;
}
}
cout<<(ans+1)%mod;
return 0;
}
# | 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... |