eolymp
Problems

Save Walle

published at 12/22/22, 8:08:22 pm

include<bits/stdc++.h>

define MAX 102

long long dp[MAX][MAX],i,j,ex,ey; using namespace std; int main(){ cin>>ex>>ey; for(i=0; i<=ex; ++i) dp[i][0]=1; for(i=1; i<=ex; ++i){ for(j=1; j<=ey and j<=i; ++j){ if(i*j%2==0) dp[i][j]=(dp[i-1][j]+dp[i][j-1])%1000000007; } } cout<<dp[ex][ey]%1000000007; }

published at 3/12/23, 6:07:05 pm

/// A% solution

include <bits/stdc++.h>

define MOD 1000000007

using namespace std;

int dp[101][101];

int main() { int ex, ey; cin >> ex >> ey; for (int x = 0; x <= ex; x++) { dp[x][0] = 1; } for (int x = 1; x <= ex; x++) { for (int y = 1; y <= ey and x >= y; y++) { if ((x * y) % 2 == 0) { dp[x][y] = (dp[x - 1][y] + dp[x][y - 1]) % MOD; } } } int ans = dp[ex][ey]; cout << ans % MOD << endl; }