#include <bits/stdc++.h>
using namespace std;
#define int long long
const int P = 1e9+7;
main()
{
ios_base::sync_with_stdio(false);
int n; cin>>n;
// cerr << n << endl;
// if(n > 5000) return 0;
vector<int> v;
v.resize(n+1);
for(int i=1; i<=n; i++)
cin>>v[i];
vector<int> result;
result.resize(n+1);
result[0] = 1;
for(int i=1; i<=n;i++)
{
int tmp = 0;
for(int j=i; j>=1; j--)
{
tmp += v[j];
tmp %= P;
if(tmp %2 == 0)
{
result[i] += result[j-1];
result[i] %= P;
}
}
}
cout << result[n] << endl;
return 0;
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 | #include <bits/stdc++.h> using namespace std; #define int long long const int P = 1e9+7; main() { ios_base::sync_with_stdio(false); int n; cin>>n; // cerr << n << endl; // if(n > 5000) return 0; vector<int> v; v.resize(n+1); for(int i=1; i<=n; i++) cin>>v[i]; vector<int> result; result.resize(n+1); result[0] = 1; for(int i=1; i<=n;i++) { int tmp = 0; for(int j=i; j>=1; j--) { tmp += v[j]; tmp %= P; if(tmp %2 == 0) { result[i] += result[j-1]; result[i] %= P; } } } cout << result[n] << endl; return 0; } |
English