Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "bits/stdc++.h"
- using namespace std;
- typedef long long ll;
- const int MAX = 1e5 + 10;
- const ll MOD = 1e9 + 7;
- ll dp[MAX][10];
- void add(ll &a, ll b) {
- b %= MOD;
- a = (a + b) % MOD;
- }
- int main() {
- ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
- int t; cin >> t;
- while(t --) {
- int n; cin >> n;
- string s; cin >> s;
- for(int i = 0; i <= n; i ++) for(int j = 0; j < 10; j ++) dp[i][j] = 0;
- dp[0][0] = 1;
- for(int i = 0; i < n; i ++) {
- if(s[i] == '-') {
- for(int j = 1; j < 10; j ++) {
- for(int k = 0; k <= j; k ++) {
- add(dp[i + 1][j], dp[i][k]);
- }
- }
- }
- else {
- int d = s[i] - '0';
- for(int j = 0; j <= d; j ++) add(dp[i + 1][d], dp[i][j]);
- }
- }
- ll ans = 0;
- for(int i = 0; i < 10; i ++) add(ans, dp[n][i]);
- cout << ans << "\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement