Codeforces Round 144 (Div. 2)
B
Non-square Equation
Codeforces
1400
原题
← AC →
翻译中…

Let's consider equation:

翻译中…

$*x*^{2} + *s*(*x*)·*x* - *n* = 0,$

翻译中…

where $*x*, *n*$ are positive integers, $*s*(*x*)$ is the function, equal to the sum of digits of number $*x*$ in the decimal number system.

翻译中…

You are given an integer $*n*$, find the smallest positive integer root of equation $*x*$, or else determine that there are no such roots.

翻译中…

Input

翻译中…

A single line contains integer $*n*$ $(1 ≤ *n* ≤ 10^{18})$ — the equation parameter.

翻译中…

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use cin, cout streams or the %I64d specifier.

翻译中…

Output

翻译中…

Print -1, if the equation doesn't have integer positive roots. Otherwise print such smallest integer $*x*$ $(*x* > 0)$, that the equation given in the statement holds.

翻译中…

Note

翻译中…

In the first test case $*x* = 1$ is the minimum root. As $*s*(1) = 1$ and $1^{2} + 1·1 - 2 = 0$.

翻译中…

In the second test case $*x* = 10$ is the minimum root. As $*s*(10) = 1 + 0 = 1$ and $10^{2} + 1·10 - 110 = 0$.

翻译中…

In the third test case the equation has no roots.

翻译中…

样例

Input #1
2
Output #1
1
InputCopy OutputCopy
Input #2
110
Output #2
10
InputCopy OutputCopy
Input #3
4
Output #3
-1
InputCopy OutputCopy
题目信息
题号
233B
时间限制
1 s
内存限制
256 MB
标签
二分
暴力
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。