<awangdev>311. Sparse Matrix Multiplication_2.java
private int multiple(int[][] A, int[][] B, int row, int col) {

        int sum = 0;
        for (int i = 0; i < B.length; i++) sum += A[row][i] * B[i][col];
        return sum;
    }
private int sample_funcname ( int [ ] [ ] var_0 , int [ ] [ ] var_1 , int var_2 , int var_3 ) {
  int var_5 = 0 ;
  for ( int var_6 = 0 ;
  var_6 < var_1 . length ;
  var_6 ++ ) var_5 += var_0 [ var_2 ] [ var_6 ] * var_1 [ var_6 ] [ var_3 ] ;
  return var_5 ;
}
