DEV C$++$

Using a random generator to construct a set of linear equations with $N$ unknowns $(x_1{x}_N).$ Each coefficient $)$ of the variable and equivalent sum $(b_1-b_N)$ must be kept at $-10$ &$10,$ and they are all integers. The row operation of the array and loop is used to find the solutions. $(1.$ Ignore the situations with no solution and infinite solutions. $2.$ Dynamic memory allocation and pointer notation are needed to use in your program.$)$

$a_1^1{x}_1+a_2^1{x}_2+a_3^1{x}_3+$cdots$+$cdots$+$cdots$+a_N^1{x}_N=b_1$

$a_1^2{x}_1+a_2^2{x}_2+a_3^2{x}_3+$cdots$+$cdots$+$cdots$+a_N^2{x}_N=b_2$

$a_1^3{x}_1+a_2^3{x}_2+a_3^3{x}_3+$cdots$+$cdots$+$cdots$+a_N^3{x}_N=b_3$

$a_1^4{x}_1+a_2^4{x}_2+a_3^4{x}_3+$cdots$+$cdots$+$cdots$+a_N^4{x}_N=b_4$

vdots

vdots

$a_1^{N-1}{x}_1+a_2^{N-1}{x}_2+a_3^{N-1}{x}_3+$cdots$+$cdots$+$cdots$+a_N^{N-1}{x}_N=b_{N-1}$

$a_1^N{x}_1+a_2^N{x}_2+a_3^N{x}_3+$cdots$+$cdots$+$cdots$+a_N^N{x}_N=b_N$