Judge's Output Data for 2007 DSPC

Problem A:

Array 1 has the sum 8 appear 8 times.
Array 2 has the sum 6 appear 4 times.
Array 3 has the sum 3 appear 484 times.
Array 4 has the sum 13 appear 9 times.
Array 5 has the sum 3 appear 0 times.
Array 6 has the sum 10 appear 2 times.
Array 7 has the sum 12 appear 5 times.
Array 8 has the sum 12 appear 9 times.

Problem B:

Case 1 has a maximum score of 30.
Case 2 has a maximum score of 45.
Case 3 has a maximum score of 608.
Case 4 has a maximum score of 13150.

Problem C:

Input 1: 1 1 1
Input 2: 0 0 0
Input 3: -2 4 4
Input 4: 3 3 3
Input 5: -9 9 9
Input 6: -2 6 6
Input 7: -8 -2 -2
Input 8: -11 -5 15
Input 9: -1 5 25
Input 10: 10 2 22
Input 11: -34 14 18
Input 12: -21 5 9
Input 13: -33 19 23
Input 14: -38 14 42
Input 15: -22 30 26
Input 16: -5 21 17
Input 17: -45 15 51
Input 18: -26 0 36
Input 19: -74 20 32
Input 20: -81 13 57
Input 21: -59 35 79
Input 22: -36 20 64
Input 23: -90 44 56
Input 24: -65 39 31
Input 25: -39 65 57
Input 26: -48 38 116
Input 27: -62 66 152
Input 28: -33 49 135
Input 29: -151 79 129
Input 30: -120 52 102
Input 31: -150 20 70
Input 32: -161 9 111
Input 33: -127 43 145
Input 34: -92 36 206
Input 35: -158 24 170
Input 36: -121 -1 145
Input 37: -157 37 183
Input 38: -170 24 178
Input 39: -130 -16 138
Input 40: -89 -49 105
Input 41: -255 -7 195
Input 42: -212 -46 156
Input 43: -320 -2 200
Input 44: -335 -17 285
Input 45: -289 29 331
Input 46: -242 -10 292
Input 47: -352 38 276
Input 48: -303 17 275
Input 49: -253 107 325
Input 50: -270 90 324
Input 51: -296 142 376
Input 52: -243 101 335
Input 53: -367 155 281
Input 54: -312 144 350
Input 55: -354 88 294
Input 56: -373 69 283
Input 57: -315 127 341
Input 58: -256 80 294
Input 59: -484 140 282
Input 60: -423 83 225
Input 61: -483 145 287
Input 62: -504 124 422
Input 63: -440 188 358
Input 64: -375 175 357
Input 65: -507 241 423
Input 66: -440 186 368
Input 67: -608 254 436
Input 68: -631 231 429
Input 69: -561 301 511
Input 70: -490 238 448
Input 71: -656 214 584
Input 72: -583 145 515
Input 73: -655 219 589
Input 74: -680 204 736
Input 75: -718 280 812
Input 76: -641 247 743
Input 77: -797 325 901
Input 78: -718 258 834
Input 79: -796 178 818
Input 80: -823 151 737
Input 81: -741 233 819
Input 82: -658 158 744
Input 83: -978 242 844
Input 84: -893 225 771
Input 85: -807 311 857
Input 86: -836 282 852
Input 87: -902 194 764
Input 88: -813 117 687
Input 89: -1021 207 669
Input 90: -930 168 650
Input 91: -976 260 742
Input 92: -1007 229 719
Input 93: -913 323 813
Input 94: -818 304 806
Input 95: -850 400 710
Input 96: -753 319 629
Input 97: -849 473 775
Input 98: -882 440 710
Input 99: -932 620 890

Problem D:

Case 1 has 3 squares.
Case 2 has 40 squares.
Case 3 has 0 squares.
Case 4 has 1 squares.
Case 5 has 6 squares.

Problem E:

Set 1 can pack 3 boxes.
Set 2 can pack 4 boxes.
Set 3 can pack 4 boxes.
Set 4 can pack 3 boxes.
Set 5 can pack 1 boxes.
Set 6 can pack 7 boxes.
Set 7 can pack 9 boxes.
Set 8 can pack 9 boxes.

Problem F:

Set 1 has a cycle length of 8.
Set 2 has a cycle length of 1.
Set 3 has a cycle length of 1.
Set 4 has a cycle length of 8.
Set 5 has a cycle length of 8.
Set 6 has a cycle length of 8.
Set 7 has a cycle length of 1.
Set 8 has a cycle length of 8.
Set 9 has a cycle length of 8.
Set 10 has a cycle length of 8.