Sorry, I just realized that's not going to work easily because the row operations change the rows. So, for example, the elementary operations of multiplying row 1 by 2 and followed by adding row 1 to row 3 results in the sequence
<br />
\begin{vmatrix}r1\\r2\\r3\end{vmatrix} \rightarrow \begin{vmatrix}2r1\\r2\\r3\end{vmatrix} \rightarrow<br />
\begin{vmatrix}r1\\r2\\r3+2r1<br />
\end{vmatrix}<br />
You don't end up at
<br />
\begin{vmatrix}2r1\\r2\\r3+r1\end{vmatrix}<br />
as you might expect. If you keep track of what's in the new rows and how to combine them in just the right way to get the final matrix you want, this method will work, but there's a simpler way. The most straightforward way to solve this problem is to use the fact that the determinant is a linear function of its rows. What this means, for example, is that
\begin{vmatrix}2r1+3r2\\r3+2r1\\r2-r1-3r3\end{vmatrix} = 2\begin{vmatrix}r1\\r3+2r1\\r2-r1-3r3\end{vmatrix} + 3\begin{vmatrix}r2\\r3+2r1\\r2-r1-3r3\end{vmatrix}
Now if you work on the second row of the first matrix on the RHS, you have
\begin{vmatrix}r1\\r3+2r1\\r2-r1-3r3\end{vmatrix} = 2\begin{vmatrix}r1\\r1\\r2-r1-3r3\end{vmatrix} + \begin{vmatrix}r1\\r3\\r2-r1-3r3\end{vmatrix} = \begin{vmatrix}r1\\r3\\r2-r1-3r3\end{vmatrix}
The matrix with r1 as both its first and second row has a determinant of 0, so you can get rid of it. Eventually you'll get to matrices with determinant 0 or matrices consisting of some permutation of r1, r2, and r3, whose determinant will be either +det(A) or -det(A). When you simplify at the end, you should find det(B)=13 det(A).