func_code_string: #include <bits/stdc++.h>   using namespace std;   long long dp[101][101][11][2];   long long k1, k2;   long long solve(long long n1, long long n2, long long count, long long flag) {     if (n1 < 0 || n2 < 0) {       return 0;     }     if (n1 == 0 && n2 == 0) {       return 1;     }     if (flag != -1 && dp[n1][n2][count][flag] != -1) {       return dp[n1][n2][count][flag];     }     long long i;     long long ans = 0;     if (flag != 1) {       for (i = 1; i <= k2; i++) {         ans += solve(n1, n2 - i, i, 1);         ans %= (long long)1e8;       }     }     if (flag != 0) {       for (i = 1; i <= k1; i++) {         ans += solve(n1 - i, n2, i, 0);         ans %= (long long)1e8;       }     }     if (flag != -1) dp[n1][n2][count][flag] = ans;     return ans;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     long long n1, n2;     cin >> n1 >> n2 >> k1 >> k2;     memset(dp, -1, sizeof(dp));     cout << solve(n1, n2, 0, -1);     return 0;   }   