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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
| #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
#define MOD 100000
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dp[105][105], dp2[105][105];
int main() {
int w, h;
while(cin >> w >> h) {
if(w == 0 && h == 0) break;
memset(dp, 0, sizeof(dp));
memset(dp2, 0, sizeof(dp2));
dp[0][0] = 1;
dp2[0][0] = 1;
rep(i, w) {
dp[0][i] = 1;
dp2[0][i] = 1;
}
rep(i, h) {
dp[i][0] = 1;
dp2[i][0] = 1;
}
REP(i, 1, h) {
REP(j, 1, w) {
dp[i][j] += dp[i][j-1];
if(i - 2 >= 0) dp[i][j] += dp2[i-2][j];
dp[i][j] %= MOD;
dp2[i][j] += dp2[i-1][j];
if(j - 2 >= 0) dp2[i][j] += dp[i][j-2];
dp2[i][j] %= MOD;
}
}
if(h == 2 || w == 2) cout << 2 << endl;
else cout << (dp[h-1][w-1] + dp[h-2][w-3]) % MOD << endl;
}
return 0;
}
|