cf-【Non-square Equation】

Non-square Equation

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

Let's consider equation:

x² + 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¹⁸) — 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.

Sample Input

Input

2

Output

1

Input

110

Output

10

Input

4

Output

-1

Hint

In the first test case x = 1 is the minimum root. As s(1) = 1 and 1² + 1·1 - 2 = 0.

In the second test case x = 10 is the minimum root. As s(10) = 1 + 0 = 1 and 10² + 1·10 - 110 = 0.

In the third test case the equation has no roots.

化简一下就会知道，x的取值不会超过10^9，那最大肯定是81啊
一个一个的枚举，把给出的方程按照一元二次方程求解，记住
方程的解一定要直接写出来，别分部写，不然会WA到你怀疑
人生，我 WA 12次 ；很jian的题目

#include<cstdio>
#include<cmath>
typedef __int64 LL;
int judge(int s)
{
	int sum=0;
	while(s)
	{
		sum+=s%10;
		s/=10;
	} 
	return sum;
} 
int main()
{ 
	LL n;
	scanf("%I64d",&n);
	double a;
	int i,b,flag=1;
	for(i=1;i<=81;++i)
	{
		a=(sqrt(i*i+4*n)-i)/2;
		b=(int)a;
		if(b==a&&judge(b)==i)
		{
			printf("%d\n",b);
			flag=0;
			break; 
		} 
	} 
	if(flag)
		printf("-1\n"); 
	return 0;
}