#### Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

## Problem Description

Peanut has two different piles of diskettes he wants to throw away (who needs diskettes nowadays). His first pile contains *A* diskettes. His second pile consists of *B* diskettes. Given *A* and *B* as a string, return the total number of diskettes Peanut has to throw away.

Your program is required to implement the following functions:

*string throwAway(string A, string B), which when given**A*and*B*, returns the total number of diskettes Peanut has to throw away.

To assist you in your incredible quest, you will be provided with the following functions:

*long long int StringToInt(string)*, which converts a string to an integer.*string IntToString(long long int)*, which converts an integer to a string.

## Input

Your function will be given two integers, *A* and *B*.

## Output

Your function should return the total number of diskettes Peanut has to throw away.

## Limits

Subtask 1 (18%): 1 <= *A*,*B* <= 1 000 000 000

Subtask 2 (34%): 1 <= *A*,*B* <= 1 000 000 000 000 000

Subtask 3 (48%): 1 <= *A*,*B* <= 1 000 000 000 000 000 000 000

## Sample Input 1

3 4

## Sample Output 1

7

## Sample Input 2

12 34

## Sample Output 2

46

### Tags

### Subtasks and Limits

Subtask | Score | #TC | Time | Memory | Scoring |
---|---|---|---|---|---|

1 | 18 | 50 | 1s | 64MB | Minimum |

2 | 34 | 50 | 1s | 64MB | Minimum |

3 | 48 | 50 | 1s | 64MB | Minimum |

4 | 0 | 2 | 1s | 64MB | Minimum |

### Judge Compile Command

g++-8 ans.cpp grader.cpp -o diskettes -Wall -Wshadow -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512