Codeforces 233B Non-square Equation（数学）

最新推荐文章于 2019-08-01 07:58:01 发布

Shyazhut

最新推荐文章于 2019-08-01 07:58:01 发布

阅读量351

点赞数

分类专栏：小有趣的思维数学 CodeForces

本文链接：https://blog.csdn.net/shyazhut/article/details/53103052

版权

CodeForces 同时被 2 个专栏收录

124 篇文章 0 订阅

订阅专栏

小有趣的思维数学

77 篇文章 0 订阅

订阅专栏

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.

题意：

对于给定的 n ，问是否存在 x 使得等式 x2 + s(x)·x - n = 0 成立，其中 s(x)为 x 各位数字之和。

思路：

对等式进行转化 -> 可推出s(x) = （n-x2）/ x ，其 s(x) 取值最大为100，进行模拟即可。、

AC CODE：

#include<stdio.h>
#include<cstring>
#include<cmath>
#include<algorithm>
#define HardBoy main()
#define ForMyLove return 0;
using namespace std;
typedef __int64 LL;
const int MYDD = 1103;

LL GetSum(LL n) {
	LL sum=0;
	while(n) {
		sum += n%10;
		n/=10;
	}
	return sum;
}

int HardBoy {
	LL n, x, ans=-1;
	scanf("%I64d", &n);

	for(LL i = 1; i <= 100; ++i) {
		LL tmp = i*i/4 + n;
		x = sqrt(tmp) - i/2;
		LL sx = GetSum(x);
		if(x*x + sx*x - n == 0) {
			ans = x;
			break;
		}
	}

	printf("%I64d\n", ans);
	ForMyLove
}