#### C. Bank Hacking

1. 它还没有被hack过
2. 必须要有一个被hack的银行和它直接相连
3. 它的防御能力必须要小于等于 Inzane 的攻击能力

#### E. Exam Cheating

It is optimal to look as many consecutive questions as possible, so when we decide to look, we share this benefit (of looking) to the next questions too, and it are stored in a and b, which denote how many of the next consecutive questions can be looked without paying one more glance.

$dp[i][j][x][y]$分别可以转移到:

1. $dp[i+1][j][x-1][y-1] + i$能否看到
2. $dp[i+1][j+1][x - 1][k - 1]+i$能否看到
3. $dp[i +1][j +1][k - 1][y-1]+i$能否看到