Description

Create a class Matrix to represent a N * N matrix.

Provide public member functions that perform or derive:

1. Matrix addition.
2. Matrix subtraction.
3. Matrix Multiplication.
4. Adding cell value by 1 (module 10). That is, if after adding 1, a cell value becomes 10 we change it to 0.
5. Matrix Transpose.

 

Hint:

Transpose of a Matrix:

A matrix which is formed by turning all the rows of a given matrix into column and vice-versa.

 

Example：

Note:

1.  This problem involves three files.

• function.h: Class definition of Matrix.
• function.cpp: Member-function definitions of Matrix.
• main.cpp: A driver program to test your class implementation.

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

 

 

function.h

#ifndef MATRIX_H #define MATRIX_H class Matrix { public: Matrix(); Matrix (const int , const int [50][50]); Matrix add(const Matrix) const;//add function Matrix subtract(const Matrix) const;//subtract function Matrix multiplication(const Matrix) const;//multiply function Matrix inc() const;//increased by 1 void Transpose() const;//Transpose function void output() const;//Note that each output should be followed by a new //line character. private: int matrix[50][50]; int matrix_size; }; //end class Matrix #endif /* function_h */

main.cpp

#include <iostream> #include <stdio.h> #include "function.h" using namespace std; int main(){ int N; int matrix1[50][50], matrix2[50][50]; Matrix ans; cin >> N; for (int i = 0; i<N; i++) { for (int j = 0; j<N; j++) { cin >> matrix1[i][j]; } } for (int i = 0; i<N; i++) { for (int j = 0; j<N; j++) { cin >> matrix2[i][j]; } } Matrix a(N, matrix1), b(N, matrix2); ans = a.add( b ); ans.output(); cout << endl; ans = a.subtract( b ); ans.output(); cout << endl; ans = a.multiplication( b ); ans.output(); cout << endl; a.inc().output(); cout << endl; b.inc().output(); cout << endl; a.Transpose(); cout << endl; b.Transpose(); } // end main

2. For OJ submission:

       Step 1. Include function.h into function.cpp and then implement your function.cpp. (You don’t need to modify function.h and main.cpp)

       Step 2. Submit the code of function.cpp into submission block.

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

 

Input

The first line has an integer N (1<=N<=50), which means the size of the matrix. The total number of elements in the matrix is thus N * N.

 

For the next 2N lines: the first N lines specify the elements of the first matrix a, and the following N lines specify those of the second matrix b. All of the integers in the same line are separated by a space.

Output

Your program should print the corresponding results followed by a new line character.

Sample Input  Download

Sample Output  Download

Partial Judge Code

10992.cpp

Partial Judge Header

10992.h

Tags

Discuss

Description

Create a class Polynomial. The internal representation of a Polynomial is an array of terms. Each term contains a coefficient and an exponent, e.g., the term 2x⁴ has the coefficient 2 and the exponent 4.

• Use a 51-element array, coefficients, of digits to store each coefficient.
• Use a integer variable, greatestPower, to store an exponent.

 

Provide public member functions that perform each of the following tasks:

1. Adding two Polynomial.
2. Subtracting two Polynomial.
3. Multiplying two Polynomial.
4. Printing coefficients of the Polynomial in descending order.

 

Note:

1.      This problem involves three files.

• function.h: Class definition of Polynomial.
• function.cpp: Member-function definitions of Polynomial.
• main.cpp: A driver program to test your class implementation.

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

function.h

#ifndef POLYNOMIAL_H #define POLYNOMIAL_H #include <iostream> class Polynomial { public: Polynomial(); Polynomial(const int , const int [51]); Polynomial add( const Polynomial) const; // add function Polynomial subtract( const Polynomial ) const; // subtract function Polynomial multiplication( const Polynomial ) const; // multiplication function void output() const; private: int coefficients[101]; // integer coefficients int greatestPower; // integer greatestPower }; // end class Polynomial #endif

main.cpp

#include <iostream> #include <stdio.h> #include <string> #include "function.h" using namespace std; int main() { int greatestPower1, greatestPower2; int coefficient1[51], coefficient2[51]; Polynomial ans; cin>>greatestPower1; for(int i = greatestPower1 ; i >= 0; i--) { cin>>coefficient1[i]; } cin>>greatestPower2; for(int i = greatestPower2 ; i >= 0 ; i--) { cin>>coefficient2[i]; } Polynomial a(greatestPower1, coefficient1), b(greatestPower2, coefficient2) ; ans = a.add( b ); ans.output(); cout << endl; ans = a.subtract( b ); ans.output(); cout << endl; ans = a.multiplication( b ); ans.output(); cout << endl; } // end main

2.     For OJ submission:

       Step 1. Submit only your function.cpp into the submission block.

       (***Note that you don’t need to submit your function.h.)

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

Input

There are four lines.

The first two lines represent the greatest power and the corresponding coefficients of the first polynomial.

The last two lines represent the greatest power and the corresponding coefficients of the second polynomial.

Note that the coefficients are in descending order and each element is separated by a blank.

Output

Your program should print the coefficients of the sum, difference and product of these two polynomials in descending order, respectively.

Note that every answer should be followed by a new line character.

 

Sample Input  Download

Sample Output  Download

Partial Judge Code

10993.cpp

Partial Judge Header

10993.h

Tags

Discuss

Description

A queue is an abstract data type that serves as a collection of elements, where nodes are removed only from the head of the queue and are inserted only at the tail of the queue. Two principal operations can be used to manipulate a queue: enqueue, which inserts an element at the tail, and dequeue, which removes the element at the head of the collection.

Let’s see how the queue data structure can be realized in C++.We have an approach to implement queue: linked list. Thus, we define a class as follows:

 class List_queue {

    public:

        List_queue();

        ~List_queue();

        void enqueue(const int &);

        void dequeue();

        void print();

    private:

        ListNode *head;

        ListNode *tail;

};

where List_queue implements the queue data structure.

REQUIREMENTS:

Implement the constructor, destructor, enqueue(), dequeue() and print() member functions of the List_queue class.

Note:

1.This problem involves three files.

• function.h: Class definitions.
• function.cpp: Member-function definitions.
• main.cpp: A driver program to test your class implementation.

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

function.h

#ifndef FUNCTION_H #define FUNCTION_H #include <iostream> class ListNode { friend class List_queue; //make List_queue a friend public: ListNode( const int &info ) //constructor : data( info ), nextPtr( NULL ), prevPtr( NULL ) { } //end ListNode constructor private: int data; //data ListNode *nextPtr; // next node in list ListNode *prevPtr; }; //end class ListNode class List_queue { public: List_queue(); ~List_queue(); void enqueue(const int &); void dequeue(); void print(); private: ListNode *head; ListNode *tail; }; #endif

main.cpp

#include<iostream> #include<string.h> #include "function.h" using namespace std; int main(){ List_queue L_queue; char command[10]; int n; while(cin>>command){ if(strcmp(command,"dequeue")==0){ L_queue.dequeue(); }else if(strcmp(command,"enqueue")==0){ cin >> n; L_queue.enqueue(n); }else if(strcmp(command, "print") == 0){ L_queue.print(); cout << endl; } } return 0; }

2.For OJ submission:

       Step 1. Submit only your function.cpp into the submission block.

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

Input

There are three kinds of commands:

• “enqueue integerA” represents inserting an element with int value A at the tail of the queue.
• “dequeue” represents removing the element at the head of the queue.
• “print” represents showing the current content of the queue.

Each command is followed by a new line character.

Input terminated by EOF.

Output

The output should consist of the current state of the queue.

When the queue is empty, you don’t need to print anything except a new line character.

Sample Input  Download

Sample Output  Download

Partial Judge Code

10997.cpp

Partial Judge Header

10997.h

Tags

Discuss