Description

"AHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH!!!!!!!!!!!!"

~by anonymous singer

This problem is partial judge.

You need to deal with something "big enough".

Each input will contain two big integer a, b which are up to 5000 digits.

You need to calculate a+b and a-b.

The input will end by EOF.

 

 

 

Input

a and b is both up to 5000 digits and separated by a blank

The input will end by EOF

Output

For each input print the result of a+b and a-b.

Each result is end by a \n

Sample Input  Download

Sample Output  Download

Partial Judge Code

12469.cpp

Partial Judge Header

12469.h

Tags

Discuss

Description

You are going to maintain a data structure V that each element is a int.

Give you n orders. There're four types of order

push_back:

The order will followed by a int. Push the int to the back of V.

pop_back:

Delete a int at the back of V .

If the vector is empty, do nothing.

find

The order will followed by a int means the index. Print the number V[ int ].

The index is start from 1.

If the index is invaild, do nothing.

min:

Print the smallest number in V. Print the number and its index. If you find multiple answer, print the number with smallest id.

If the vector is empty, do nothing.

max:

Print the biggest number in V. Print the number and its index. If you find multiple answer, print the number with biggest id.

If the vector is empty, do nothing.

 

Download the C++ reference.
You will see the file named "12534.cpp" but that's OK.
Just download the file and change the filename extension(副檔名) into "zip" then you can upzip the file and use the reference.
The link is below.

reference.zip

Input

The first line contains only one integer n(1 <= n <= 200000)

The following n lines each lines contains order as the description described.

Each number is in the range of int.

Output

For each order print as demand.

Remember to print \n at the end of each output.

Sample Input  Download

Sample Output  Download

Tags

Discuss

Description

episode 1: http://140.114.86.238/problem/12254/

episode 2: http://140.114.86.238/problem/12436/

episode 3: http://140.114.86.238/problem/12522/

---

After Iron Man grab all the infinity stones from Thanos and set them onto his hand, he now has the ability to decide the destiny of the whole universe...

After snapping, Iron Man's mind is teleported into the deepest layer of the stones. He knows who he have to eliminate, that is, the Thanos army.

Iron Man & Thanos thinking about this problem.

If you click Iron Man, something might happen...

---

Iron Man's mind is now located in a 2-dimension flat with lives of all creatures. He can eliminate any creature by stepping on it. Most lives are innocent creatures, and Iron Man doesn't want to eliminate them. Those lives he wants to eliminate is only the Thanos army.

As he is now in a spiritual form, he can split himself, search, and eliminate Thanos army in every direction at the same time. He can only walk up, down, left, and right. Diagonal movement such as up-left or down-right is not allowed.

Iron Man wants to know the minimum distance he have to walk in order to eliminate all the Thanos army.

---

You are given a $n\times m$ flat.

Every position may be in the following state:

• .: There's nothing here, you can pass this place without worrying.
• I: Here is the initial position you're at. There will be exactly one I on the flat.
• T: The Thanos army are represented as a T. You have to eliminate all T on the flat. To eliminate them, you have to step onto every place with state T at least once.
• C: All other innocent creatures. You cannot pass by or walk on this place since Iron Man don't want to eliminate innocents.

You're going to find out the minimum furthest distance that you need to walk.

Take sample as an example, the distance is marked below, and those red places is the place where you have to go through.

323C9
C1C98
C0CC7
212C6
CC345

 

Input

The first line contains two integers $n$ and $m$.

There are $n$ lines below. Each line contains $m$ characters, indicate the state of all positions of the flat initially.

$1\le n,\ m \le 10^3$.

Output

Output the minimum distance that Iron Man have to walk in order to eliminate all the Thanos army. If it's impossible, output -1.

Sample Input  Download

Sample Output  Download

Tags

Discuss