#include <iostream> #include <vector> #include <algorithm> #include <map> using namespace std; long long T[300003]; long long C[300003]; #define MD 1000000007 int main() { std::ios::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; for (int i=1;i<=n;i++) cin >> T[i]; C[0]=1; for (int i=1;i<=n;i++) { long long result = 0; long long sum = 0; for (int j=i;j>0;j--) { sum+=T[j]; sum%=MD; if (sum%2==0) result+=C[j-1]; } C[i] = result%MD; } cout << C[n] << '\n'; }
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 | #include <iostream> #include <vector> #include <algorithm> #include <map> using namespace std; long long T[300003]; long long C[300003]; #define MD 1000000007 int main() { std::ios::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; for (int i=1;i<=n;i++) cin >> T[i]; C[0]=1; for (int i=1;i<=n;i++) { long long result = 0; long long sum = 0; for (int j=i;j>0;j--) { sum+=T[j]; sum%=MD; if (sum%2==0) result+=C[j-1]; } C[i] = result%MD; } cout << C[n] << '\n'; } |