 　　１．按照压缩存储的概念，只存储稀疏矩阵的非零元，以两个三元组｛i,j,e}来表示矩阵的非零元的行，列和数值，就确定了一个非零元．由此，稀疏矩阵可由表示非零元的三元数组及行列数确定．

 　　２．用户输入数据作为三元组的行，列和非零元的个数，用逗号隔开．并输入非零元的行，列和数值．

 　　 ３．本程序只对两个矩阵进行四则运算，所的结果矩阵应该另生成，用二维数组存放，并放入新的矩阵中，只要对矩阵求解就能求出答案．

-1. According to the concept of compress storage, storage sparse matrix not only the zero yuan, with two three yuan group {I, j, e} to show the matrix of the nonzero yuan in the line, column and numerical, and determine a nonzero yuan. Thus, sparse matrix can be said of the zero dollars by three yuan array and determine the ranks number.



　2. User input data as three yuan group in the line, column and the number of the zero yuan, set off by a comma. And input the zero dollars in the line, column and value.



　3. This procedure in only two a matrix of arithmetic, the result of the matrix should be another generation, with a two dimensional array deposit, and into the new matrix, as long as the solution to matrix is able to find out the answer.