Preparing NOJ # Eatcoin

3000ms 1048576K

## Description:

Eric developed a new algorithm to mine a cryptocurrency called Eatcoin. Since Eric's algorithm is an evolutionary algorithm, its performance keeps improving. On the $d$-th day of the execution of Eric's algorithm, it consumes $p$ Eatcoins and then produces $q\times d^5$ Eatcoins where $p$ and $q$ are positive constants.

Eric wants to become a "duotrigintillionaire". A duotrigintillionaire is a person who has at least $10^{99}$ Eatcoins. Eric plans to exploit his algorithm to achieve his goal. Eric's algorithm can soon produce a massive amount of Eatcoins if he has enough Eatcoins. However, his algorithm cannot continue if he does not have $p$ Eatcoins when needed.

Eric gives the values of $p$ and $q$ to you. Please write a program to help Eric to compute two numbers $x$ and $y$ defined as follows.

• $x$ is the minimum number of Eatcoins required to execute Eric's algorithm to make him a duotrigintillionaire.
• $y$ is the minimum number of days required to make Eric a duotrigintillionaire if Eric has exactly $x$ Eatcoins before executing his algorithm.

## Input:

Two positive integers $p$ and $q$ are given in one line and separated by a space.

• $1\le q \le p \le 10^{18}$

## Output:

Output two lines. Print $x$ on the first line and $y$ on the second line.

## Sample Input:

50 1


## Sample Output:

117
42627697484524538


## Sample Input:

10 10


## Sample Output:

10
29041912218408574


Info Provider CodeForces Gym

Code GYM103373E

Tags

Submitted 0

Passed 0

AC Rate 0%

Date 10/31/2021 14:46:03

Related

Nothing Yet