【CodeForces】233B - Non-square Equation（思维）

最新推荐文章于 2019-03-13 21:58:20 发布

wyg1997

最新推荐文章于 2019-03-13 21:58:20 发布

阅读量460

点赞数 1

CC 4.0 BY-SA版权

分类专栏：错题本思维

本文链接：https://blog.csdn.net/wyg1997/article/details/53068615

错题本同时被 2 个专栏收录

85 篇文章

订阅专栏

思维

63 篇文章

订阅专栏

本文探讨了一种特殊的非平方方程 x^2 + s(x) * x - n = 0 的求解方法，其中 s(x) 表示 x 的十进制数位之和。文章给出了一种通过枚举 s(x) 的可能值并验证 x 是否为正整数的方法来寻找最小正整数解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接：点击打开链接

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 %I64dspecifier.

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.

   Examples
 
     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.

本在考虑4*n开根号的情况。后来发现还是太复杂不好化简。

由观察知道S(x)的范围只能是1~100，那么就枚举求x，然后验证就行了。

（之前机房来老师关门了，没贴代码=。=）

代码如下：

#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
using namespace std;
#define CLR(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define PI acos(-1.0)
#define LL __int64
int getDecimal(int x)
{
	int sum = 0;
	while (x)
	{
		sum += x % 10;
		x /= 10;
	}
	return sum;
}
int main()
{
	LL n;
	double x;
	scanf ("%I64d",&n);
	for (int i = 1 ; i <= 100 ; i++)
	{
		x = (sqrt(i*i+4*n) - i) / 2;
		if (x == (LL)x && getDecimal(x) == i)
		{
			printf ("%.lf\n",x);
			return 0;
		}
	}
	puts("-1");
	return 0;
}