csp-s Analog 59

T1:
  the most violent course built FIG BFS, but found the number of sides may reach \ (n ^ 2 \)
  considered at the time when each point 1, can be reached through the operation is odd or even a continuum,
  is omitted process of building side, for the opening of a parity set, each can to the point on a set continuous period of
  each deletion has come to the point of allowing complicated
  (set by optimized FIG ???)
 
T2:
  first, this classic model one conclusion:
    any exchange or limit the height of two rows two columns, "program number / maximum number of blocks / blocks happened" had no effect
  can then be sorted in descending order restrictions
    1. when a, B maximum value is not equal to no solution
    2. when a solution, consider the inclusion and exclusion:
      consider a simplified problem:
      a rectangular a * b values for each position in the [0, s] in each row and each column of the maximum s values are solutions.
      Set f [i] for the i-th row when at least the program does not satisfy the conditions (need to ensure that each row satisfies the condition)
      then: \ (f [i] = C (A, i) * (i * S ^ ((S + 1) ^ {ai} -s ^
{ai})) ^ b \)       then program number is \ (\ sum_ {0} = I ^ a (-1) ^ I * F [I] \) ;
 
      then the actual the problem?
      It is actually a "L" shape, with the same inclusion and exclusion method to
 
T3:
  Gugu Gu ......