Description

A stack is an abstract data type that serves as a collection of elements, where a node can be added to a stack and removed from a stack only at its top. Two principal operations can be used to manipulate a stack: push, which adds an element at the top, and pop, which removes the element at the top of the collection.

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

class List_stack {

    public:

        List_stack();

        ~List_stack();

        void push(const int &);

        void pop();

        void print();

    private:

        ListNode *head;

        ListNode *tail;

};

where List_stack implements the stack data structure

 

REQUIREMENTS:

Implement the constructor, destructor, push(), pop() and print() member functions of List_stack classes.

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_stack; //make List_stack 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_stack { public: List_stack(); ~List_stack(); void push(const int &); void pop(); void print(); private: ListNode *head; ListNode *tail; }; #endif // FUNCTION_H

main.cpp

#include<iostream> #include<string.h> #include "function.h" using namespace std; int main(){ List_stack L_stack; char command[10]; int n; while(cin>>command){ if(strcmp(command,"pop")==0){ L_stack.pop(); }else if(strcmp(command,"push")==0){ cin >> n; L_stack.push(n); }else if(strcmp(command, "print") == 0){ L_stack.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:

• “push integerA” represents adding an element with int value A at the top of the stack.
• “pop “ represents removing the element at the top of the stack.
• “print” represents showing the current content of the stack.

Each command is followed by a new line character.

Input terminated by EOF.

Output

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

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

Sample Input  Download

Sample Output  Download

Partial Judge Code

10998.cpp

Partial Judge Header

10998.h

Discuss

Description

This is a partial judge problem.

In this problem, you have to implement some power function in class special_power:

• special_power(int n)  default constructor
• int fpow(int x)  return xⁿ % 880301
• int fpow(int x, int m)  return xⁿ % m
• int fpow()  return 2ⁿ % 880301
• string fpow(string s)  return sⁿ
• string fpow(string s, int m)  return sⁿ % m

Note that n is a member in class special_power.

The definition of sⁿ: 

Repeat the elements of s n times, and connect them

For example:

• abcd⁴ = aaaabbbbccccdddd
• csst³ = cccssssssttt

The definition of sⁿ % m:

Repeat the elements of s n times, and connect them.

If the length of sⁿ is longer than m, ignore the remaining elements.

For example:

• abcd⁴ % 10 = aaaabbbbcc
• csst³ % 4 = cccs

Input

The input has only one line, contains three integer x, n, m and one string s.

For all testcase:

• 1 <= x, m <= 10⁹
• 1 <= n <= 10⁶
• 1 <= |s| <= 1000
• (1/6) 1 <= xⁿ, 2ⁿ < m <= 880301, 1 <= |s| * n <= m
• (1/6) 1 <= xⁿ, 2ⁿ < m <= 880301
• (1/6) 1 <= |s| * n <= m

Output

The output has five lines.

The 1st line, output the result of xⁿ % 880301

The 2nd line, output the result of xⁿ % m

The 3rd line, output the result of 2ⁿ % 880301

The 4th line, output the result of sⁿ

The 5th line, output the result of sⁿ % m

Sample Input  Download

Sample Output  Download

Partial Judge Code

13172.cpp

Partial Judge Header

13172.h

Tags

Discuss

Description

Kuo-chan is given a sequence A and a constant K as his birthday present from Yang-chan.

Kuo-chan is allowed to perfrom the following operation:

1. push x — push x to the tail of A
2. pop — remove the median value of A （the median value of A is A[ (|A|+1)/2 ], with index start at 1）
3. programming tanoshi — for every element a in A, assign a % K to a
4. reverse — reverse the whole A, the head becomes the tail and the tail becomes the head

 

Whenever performing pop operation, the length of A is guaranteed to be odd, hence A won't be empty.

 

For example, if A = [4, 3, 5], K = 2

push 11　►　A = [4, 3, 5, 11]

reverse ► A = [11, 5, 3, 4]

push 7　►　A = [11, 5, 3, 4, 7]

pop　►　A = [11, 5, 4, 7]

programming tanoshi　►　A = [1, 1, 0, 1] 

 

Yang-chan is curious about what A is after Kuo-chan performs some operations to it.

Help him find it out!

 

（Remember to include function.h in your function.cpp file.）

 

Input

The first line contains three integers N K Q — the length of A, the constant Yang-chan gives Kuo-chan, the number of operations Kuo-chan performs.

The second line contains N integers a₁, a₂, ..., a_N （1 <= a_i <= N） — the elements of A. 

Each of the next Q lines describes the operations. Each line is one of three types:

1. push x （1 <= x <= 10000）
2. pop
3. programming tanoshi
4. reverse

 

Different testcases have different constraints.

1. N <= 10³, Q <= 2N, K <= 4000, operations: {pop, push}
2. N <= 10³, Q <= 2N, K <= 4000, operations: {pop, push, programming tanoshi}
3. N <= 10⁵, Q <= 2N, K <= 4000, operations: {pop, push}
4. N <= 10⁵, Q <= 2N, K <= 4000, operations: {pop, push, programming tanoshi}
5. N <= 10⁵, Q <= 3N, K <= 4000, operations: {pop, push, programming tanoshi, reverse}
6. N <= 10⁵, Q <= 3N, K <= 4000, operations: {pop, push, programming tanoshi, reverse}

 

Output

You should print one line containing the elements of A after the operations. For 1 <= i <= |A|, the i-th number should be A[ i ].

Sample Input  Download

Sample Output  Download

Partial Judge Code

13472.cpp

Partial Judge Header

13472.h

Tags

Discuss

Description

Dogeon (鴿子) likes everything to be rational, just like himself. He thinks that it is irrational that floating-point numbers in C/C++ are not accurate. So he decides to implement a class Rational to represent rational numbers. The class Rational should have the following member functions:

1. Rational(int numerator, int denominator):
   a constructor that takes two integers numerator and denominator to represent the rational number.
2. Rational Add(Rational const& b) const:
   a member function that takes another Rational object b and returns a new Rational object that represents the sum of the two rational numbers.
3. Rational Sub(Rational const& b) const:
   a member function that takes another Rational object b and returns a new Rational object that represents the subtraction of the two rational numbers.
4. Rational Mul(Rational const& b) const:
   a member function that takes another Rational object b and returns a new Rational object that represents the multiplication of the two rational numbers.
5. Rational Div(Rational const& b) const:
   a member function that takes another Rational object b and returns a new Rational object that represents the division of the two rational numbers.
6. void print(std::ostream& os) const:
   a member function that prints the rational number in the simplest form numerator/denominator to the output stream os. The simplest form means that the numerator and the denominator have no common divisor other than 1. Also, the denominator should be positive.

• This is a partial judge problem. All you have to do is to implement the functions mentioned above.
• This is a work of fiction. Any resemblance to actual persons, living or dead, or actual events is purely coincidental.

Input

The first line of the input contains an integer \(N\), the number of expressions to be evaluated.

The next \(N\) lines each contain the expression to be evaluated. Each expression contains two rational numbers \(\frac{n_{i,1}}{d_{i,1}}, \frac{n_{i,2}}{d_{i,2}}\) and an operator \(op_i\), separated by a space. The rational numbers are in the form numerator/denominator and the operator is one of +, -, *, /.

\(N\)
\(n_{1,1}/d_{1,1} \quad op_1 \quad n_{1,2}/d_{1,2}\)
\(n_{2,1}/d_{2,1} \quad op_2 \quad n_{2,2}/d_{2,2}\)
\(\vdots\)
\(n_{N,1}/d_{N,1} \quad op_N \quad n_{N,2}/d_{N,2}\)

Constraints

• \(1 \leq N \leq 10^5\)
• \(-10^9 \leq n_{i,1}, d_{i,1}, n_{i,2}, d_{i,2} \leq 10^9\)
• It is guaranteed that the denominator of the rational numbers is not 0.
• It is guaranteed that if operator is /, the second rational number is not 0.
• It is guaranteed that the simplest form of the result of each expression has a numerator and a denominator that are both within \([-10^9, 10^9]\).

Output

Each line of the output should contain the result of the corresponding expression in the simplest form \(n_{i,3}/d_{i,3}\).

$\frac{n_{i,3}}{d_{i,3}} = (\frac{n_{i,1}}{d_{i,1}} \, \mathrm{op_i} \, \frac{n_{i,2}}{d_{i,2}})$, $d_{i,3} > 0$ and $\mathrm{gcd}(n_{i,3}, d_{i,3}) = 1$.

\(n_{1,3}/d_{1,3}\)
\(n_{2,3}/d_{2,3}\)
\(\vdots\)
\(n_{N,3}/d_{N,3}\)

Sample Input  Download

Sample Output  Download

Partial Judge Code

14246.cpp

Partial Judge Header

14246.h

Tags

Discuss

Description

In this problem, you are asked to implement a class Vector that represents a vector in 2D space. The class should support the following operations:

• Addition (+)
• Dot product (*)
• Cross product (^)

Using these operations, you should also be able to calculate the following:

• The area of the triangle formed by two vectors
• The projection of vector \(v_1\) onto vector \(v_2\)

useful link

Warning: You should use C++11 or later versions, or else you will get Compile Error! reason

Hint: Please use std::abs or fabs instead of abs to get the absolute value.

Input

The first line contains two integers \(x_1, y_1\), which represents the first vector \(v_1\).
The second line contains two integers \(x_2, y_2\), which represents the second vector \(v_2\).

\(x_1 \quad y_1\)
\(x_2 \quad y_2\)

Constraints

• \(1 \le x_1,y_1,x_2,y_2 \le 1000\)

Output

As main function in "14274.cpp"

Sample Input  Download

Sample Output  Download

Partial Judge Code

14274.cpp

Partial Judge Header

14274.h

Tags

Discuss