Matrix Multiplication of Sparse Matrices

Matrix Multiplication of Sparse Matrices C language project.

Description

In this project you have to write a program that can compute the matrix product of two sparse matrices that are represented as lists in the input format. (i.e., the matrices have 0 for all non-specified entries).

Make sure that you do not use more memory than needed to store the input.

Input

The first number of the input, N, describes the number of entries of the first matrix A. Then the entries of A follow (see below), then a number, M, which indicates the number of entries of the second matrix B. Then the actual entries of B will follow.

The entries of the matrices A, B, are encoded, 1 per line, in the following format:

row_id column_id value

You can assume that entries are sorted first by row, then by column. Entries themselves are integers.

Output

A sparse matrix representation of the output matrix. Entries are sorted first by row, then by column.

Sample Input

3

0 0 4

0 1 2

1 0 -1

2

1 0 10

1 1 -10

Sample Output

0 0 20

0 1 -20

Compétences : Programmation C

Voir plus : sparse matrices in c, sparse matrix multiplication, assembly code matrix multiplication, matrix multiplication mips program, matrix multiplication mips assembly, matrix multiplication counting instruction frequencies mips, black box test matrix multiplication software, matrix multiplication using mips, mips matrix multiplication program, assembly language matrix multiplication program, mips assembly program matrix multiplication, version matrix multiplication mips, mips instruction matrix multiplication, write assembly language program matrix multiplication, mips matrix multiplication, matrix multiplication assembly

N° du projet : #14882016