Non-square Equation 【数学公式】

Let’s consider equation:

x2 + 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 ≤ 1018) — 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.

Example
Input
2
Output
1
Input
110
Output
10
Input
4
Output
-1
Note
In the first test case x = 1 is the minimum root. As s(1) = 1 and 12 + 1·1 - 2 = 0.

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

In the third test case the equation has no roots.

题目大意 ，找到 最小的使式子成立的值x

思路 ：第一次想着枚举 ，n的因子，但是一想，10^18次方 数字的 因子，还是要 用 根号 n 的时间复杂度，肯定还是超时间。。
问了别人 可以 用求根公式，然后枚举 s（x）就可以了
这样的思路还是 蛮好理解的
代码

#include<stdio.h>
#include<math.h>
char s[100];
long long  f(long long  x)
{
    long long  sum=0;
    while(x)
    {
        sum+=x%10;
        x/=10;
    }
    return sum;
}
int main()
{ 
    long long  n;
    scanf("%lld",&n);
    int i,j;double an;
    for(i=1;i<200;i++)
     {
        an=(-1*i+sqrt(i*i+4*n)*1.0)/2;
        if(an==(int)an) // 能够得到正整数的解，x  
        {
            if(i==f((int)an))  //并且当前的解还要满足 其各个位相加 要等于它本身 
            break;
         }
      }  
    if(i>=200) printf("-1\n");
    else printf("%d\n",(int)an);
    return 0;
}