10852 - Simple Addition   

Status  |  Limits Submit

Description

Four arrays A, B, C and D with size MxN. B, C, D are stored in an array of pointers, and A is stored in a separated array. The task is to add the designated elements of A and the corresponding element from a chosen array of B, C, D, and output the result.

 

Take sample input as an example. Size of the arrays are 3 rows by 2 columns, initial values are as the form below. Input number “2” in the sixth line indicates D is chosen array and we want the sum of elements with two indices (1,0), (2,0)

Therefore, the answer is A(1,0)+D(1,0)+A(2,0)+D(2,0)=2+8+4+10=24

Note that

1.      This problem involves three files.

  • function.h: Function definition of addition.
  • function.c: Function describe of addition.
  • main.c: A driver program to test your implementation.

You will be provided with main.c and function.h, and asked to implement function.c.

2.     For OJ submission:

       Step 1. Submit only your function.c into the submission block. (Please choose c compiler) 

       Step 2. Check the results and debug your program if necessary.

3.     If the same index appears n times, just add the values n times.

main.c

#include <stdio.h>

#include ”function.h”

int main(void) {

  int a[50][50], b[50][50], c[50][50], d[50][50];

  int index_to_add[20];

  int *entry[3];

  int i, j, m, n, array_num, num_ind;


  scanf("%d %d", &m, &n);


  for(i=0; i<m; i++)

    for(j=0; j<n; j++)

      scanf(“%d”, &a[i][j]);

  for(i=0; i<m; i++)

    for(j=0; j<n; j++)

      scanf(“%d”, &b[i][j]);

  for(i=0; i<m; i++)

    for(j=0; j<n; j++)

      scanf(“%d”, &c[i][j]);

  for(i=0; i<m; i++)

    for(j=0; j<n; j++)

      scanf(“%d”, &d[i][j]);

  scanf("%d", &array_num);

  scanf("%d", &num_ind);

  for(i=0; i<num_ind*2; i=i+2)

    scanf("%d %d", &index_to_add[i], &index_to_add[i+1]);


  entry[0] = &b[0][0];

  entry[1] = &c[0][0];

  entry[2] = &d[0][0];


  /*

    &a[0][0]: Address of A’s first element

    array_num: Index of chosen array. 0: B, 1:C, 2:D.

    entry: An array of pointers, stores {&b[0][0], &c[0][0], &d[0][0]}

    index_to_add: Locations to be summed. Value would be {1,0,2,0,…} in sample case.

    num_ind: Number of locations to be summed.

  */

  printf("%d\n", addition(&a[0][0], array_num, entry, index_to_add, num_ind));


  return 0;

}

function.h

#ifndef FUNCTION_H

#define FUNCTION_H

int addition(int*, int, int*[], int*, int);

#endif

Input

The first line is the size of arrays, M rows by N columns. The following four lines are initial values arranged by row major. The sixth line tells B, C or D is chose. The next line is the number of elements k to be summed. And the last k lines are the row and column indices of elements to be add. 0 < M, N < 50. 0 < k < 10. Index starts from 0.

Output

An integer, sum of desired elements.

Sample Input  Download

Sample Output  Download

Partial Judge Code

10852.c

Partial Judge Header

10852.h

Tags




Discuss