Case #1: 22 16
Case #2: 23 2520
Case #3: 12 173
Case #4: 38 135000
Case #5: 30 30907
Case #6: 39 99840
Case #7: 27 9360
Case #8: 26 1485
Case #9: 28 6074
Case #10: 22 19
Case #11: 23 2527
Case #12: 17 45
Case #13: 28 4026
Case #14: 25 924
Case #15: 26 657800
Case #16: 44 189053520
Case #17: 26 325
Case #18: 17 10
Case #19: 45 4440
Case #20: 8 19
Case #21: 39 113750
Case #22: 28 10
Case #23: 29 23
Case #24: 21 1761
Case #25: 39 2170800
Case #26: 28 61819
Case #27: 30 1
Case #28: 31 10704
Case #29: 9 3
Case #30: 34 1175142
Case #31: 12 73
Case #32: 38 56700
Case #33: 28 7251
Case #34: 30 10537
Case #35: 28 29
Case #36: 16 1
Case #37: 30 450
Case #38: 28 485100
Case #39: 29 180
Case #40: 29 406
Case #41: 45 11705867
Case #42: 20 1980
Case #43: 31 67626
Case #44: 24 2024
Case #45: 47 70200
Case #46: 24 37224
Case #47: 50 135415056
Case #48: 11 2
Case #49: 29 1
Case #50: 11 140
Case #51: 42 963
Case #52: 35 79755
Case #53: 18 1820
Case #54: 36 10866240
Case #55: 13 10
Case #56: 45 110
Case #57: 30 210000
Case #58: 34 22022
Case #59: 18 15
Case #60: 20 3003
Case #61: 29 406
Case #62: 29 117
Case #63: 38 18012
Case #64: 31 89185
Case #65: 13 220
Case #66: 23 56
Case #67: 36 696488
Case #68: 9 36
Case #69: 20 11
Case #70: 40 2742560
Case #71: 27 17430
Case #72: 35 1944
Case #73: 30 280
Case #74: 29 30
Case #75: 35 21504
Case #76: 32 57504
Case #77: 37 955080
Case #78: 20 1650
Case #79: 26 66
Case #80: 37 56592
Case #81: 19 630
Case #82: 30 252
Case #83: 44 655424
Case #84: 39 711480
Case #85: 25 136
Case #86: 21 12
Case #87: 30 135
Case #88: 30 35
Case #89: 9 9
Case #90: 28 840
Case #91: 44 474650
Case #92: 25 285841
Case #93: 27 82056
Case #94: 47 22609692
Case #95: 47 754380
Case #96: 23 5790
Case #97: 38 139296
Case #98: 14 144
Case #99: 21 460
Case #100: 48 96094950
Case #1: 22 16
Case #2: 23 2520
Case #3: 12 173
Case #4: 38 135000
Case #5: 30 30907
Case #6: 39 99840
Case #7: 27 9360
Case #8: 26 1485
Case #9: 28 6074
Case #10: 22 19
Case #11: 23 2527
Case #12: 17 45
Case #13: 28 4026
Case #14: 25 924
Case #15: 26 657800
Case #16: 44 189053520
Case #17: 26 325
Case #18: 17 10
Case #19: 45 4440
Case #20: 8 19
Case #21: 39 113750
Case #22: 28 10
Case #23: 29 23
Case #24: 21 1761
Case #25: 39 2170800
Case #26: 28 61819
Case #27: 30 1
Case #28: 31 10704
Case #29: 9 3
Case #30: 34 1175142
Case #31: 12 73
Case #32: 38 56700
Case #33: 28 7251
Case #34: 30 10537
Case #35: 28 29
Case #36: 16 1
Case #37: 30 450
Case #38: 28 485100
Case #39: 29 180
Case #40: 29 406
Case #41: 45 11705867
Case #42: 20 1980
Case #43: 31 67626
Case #44: 24 2024
Case #45: 47 70200
Case #46: 24 37224
Case #47: 50 135415056
Case #48: 11 2
Case #49: 29 1
Case #50: 11 140
Case #51: 42 963
Case #52: 35 79755
Case #53: 18 1820
Case #54: 36 10866240
Case #55: 13 10
Case #56: 45 110
Case #57: 30 210000
Case #58: 34 22022
Case #59: 18 15
Case #60: 20 3003
Case #61: 29 406
Case #62: 29 117
Case #63: 38 18012
Case #64: 31 89185
Case #65: 13 220
Case #66: 23 56
Case #67: 36 696488
Case #68: 9 36
Case #69: 20 11
Case #70: 40 2742560
Case #71: 27 17430
Case #72: 35 1944
Case #73: 30 280
Case #74: 29 30
Case #75: 35 21504
Case #76: 32 57504
Case #77: 37 955080
Case #78: 20 1650
Case #79: 26 66
Case #80: 37 56592
Case #81: 19 630
Case #82: 30 252
Case #83: 44 655424
Case #84: 39 711480
Case #85: 25 136
Case #86: 21 12
Case #87: 30 135
Case #88: 30 35
Case #89: 9 9
Case #90: 28 840
Case #91: 44 474650
Case #92: 25 285841
Case #93: 27 82056
Case #94: 47 22609692
Case #95: 47 754380
Case #96: 23 5790
Case #97: 38 139296
Case #98: 14 144
Case #99: 21 460
Case #100: 48 96094950
Let's say that you have two words, A and B. f(A, B) = (length, num).
If A[0] == B[0], then f(A, B) = f(A', B') + (1, 0), where X' is X without first character.
If A[0] != B[0], then count both f(A', B) and f(A, B'). If lengths are different, return the pair with smaller one. Otherwise return (length, num1 + num2).
Case #1: 22 16
Case #2: 23 2520
Case #3: 12 173
Case #4: 38 135000
Case #5: 30 30907
Case #6: 39 99840
Case #7: 27 9360
Case #8: 26 1485
Case #9: 28 6074
Case #10: 22 19
Case #11: 23 2527
Case #12: 17 45
Case #13: 28 4026
Case #14: 25 924
Case #15: 26 657800
Case #16: 44 189053520
Case #17: 26 325
Case #18: 17 10
Case #19: 45 4440
Case #20: 8 19
Case #21: 39 113750
Case #22: 28 10
Case #23: 29 23
Case #24: 21 1761
Case #25: 39 2170800
Case #26: 28 61819
Case #27: 30 1
Case #28: 31 10704
Case #29: 9 3
Case #30: 34 1175142
Case #31: 12 73
Case #32: 38 56700
Case #33: 28 7251
Case #34: 30 10537
Case #35: 28 29
Case #36: 16 1
Case #37: 30 450
Case #38: 28 485100
Case #39: 29 180
Case #40: 29 406
Case #41: 45 11705867
Case #42: 20 1980
Case #43: 31 67626
Case #44: 24 2024
Case #45: 47 70200
Case #46: 24 37224
Case #47: 50 135415056
Case #48: 11 2
Case #49: 29 1
Case #50: 11 140
Case #51: 42 963
Case #52: 35 79755
Case #53: 18 1820
Case #54: 36 10866240
Case #55: 13 10
Case #56: 45 110
Case #57: 30 210000
Case #58: 34 22022
Case #59: 18 15
Case #60: 20 3003
Case #61: 29 406
Case #62: 29 117
Case #63: 38 18012
Case #64: 31 89185
Case #65: 13 220
Case #66: 23 56
Case #67: 36 696488
Case #68: 9 36
Case #69: 20 11
Case #70: 40 2742560
Case #71: 27 17430
Case #72: 35 1944
Case #73: 30 280
Case #74: 29 30
Case #75: 35 21504
Case #76: 32 57504
Case #77: 37 955080
Case #78: 20 1650
Case #79: 26 66
Case #80: 37 56592
Case #81: 19 630
Case #82: 30 252
Case #83: 44 655424
Case #84: 39 711480
Case #85: 25 136
Case #86: 21 12
Case #87: 30 135
Case #88: 30 35
Case #89: 9 9
Case #90: 28 840
Case #91: 44 474650
Case #92: 25 285841
Case #93: 27 82056
Case #94: 47 22609692
Case #95: 47 754380
Case #96: 23 5790
Case #97: 38 139296
Case #98: 14 144
Case #99: 21 460
Case #100: 48 96094950
Input :
AAA
EMPTYLINE
ISIMPORTANT
my output:
Case #1: 3 1
Case #2: 0 1
Case #3: 16 32
I think that My Code process completely...
Would you give me my fault ?
Please give some tips. thanks.