Sqrt Approaching
题号:NC211824
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
Special Judge, 64bit IO Format: %lld

题目描述

Given three positive integers , where is NOT a perfect square number, you should find two positive integers satisfying .

You can assume that solution always exists, and you should print any one of them.

输入描述:

The first line contains one integer .

The second line contains one integer .

The third line contains one integer .

It is guaranteed that is NOT a perfect square number.

输出描述:

The first line contains one integer .

The second line contains one integer .
示例1

输入

复制
2
1
2

输出

复制
3
2

说明

It can be shown that (1\times 3 - 2\times 2)(3-2\times\sqrt{2}) = -0.1715728752538099023966225515806\cdots < 0.