Add adjugate_matrix

[adamant-pwn]

Resolves #1269.

I used matrix_inverse as a template, but also added the following generators:

• almost_perm_max_random.cpp: Same as perm_max_random.cpp, but changes a random item into 0.
• almost_identity.cpp: An identity matrix, but random item is changed into 0.
• highrank_max_random.cpp: A random matrix, but with 50% chance a random row is changed into a linear combination of two other rows, and with an independent 50% chance same happens to columns.

I think I need some help with Japanese strings for task.md.

[maspypy]

Here is the Japanese statement.

@{lang.en}
Given $N \times N$ matrix $A = \lbrace a_{ij} \rbrace$ with entries in $\mathbb{Z}/@{param.MOD}\mathbb{Z}$, print $\operatorname{adj} A = \lbrace (-1)^{i+j}M_{ji} \rbrace$, where $M_{ij}$ is the determinant of the matrix that is obtained from $A$ by removing its $i$-th row and $j$-th column. 
@{lang.ja}
$\mathbb{Z}/@{param.MOD}\mathbb{Z}$ 成分の $N\times N$ 行列 $A = \lbrace a_{ij} \rbrace$ が与えられます．
$A$ の余因子行列 $\operatorname{adj} A = \lbrace (-1)^{i+j}M_{ji} \rbrace$ を出力してください．ただし $M_{ij}$ は $A$ から $i$ 行目，$j$ 列目を取り除くことによって得られる行列の行列式です．
@{lang.end}

[maspypy]

I implemented it as well, and I was able to confirm an AC!

How about adding a test case for nontrivial_frobenius_form for this problem as well? It can be added simply by copying it from characteristic_polynomial.

[maspypy]

I also suggest adding a test case for $n=1$.
I think it would be ok to simply add it as example_03.

[adamant-pwn]

Thanks for the review! I have updated the PR.

[maspypy]

Thank you! I will merge.