【CodeForces】233B - Non-square Equation(思维)
2016-11-07 18:05
357 查看
题目链接:点击打开链接
B. Non-square Equation
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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
output
input
output
input
output
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 __int64int 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;
}
B. Non-square Equation
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 __int64int 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;
}
相关文章推荐
- 【Codeforces-233B】-Non-square Equation(思维,公式转换)
- CodeForces 233B Non-square Equation
- 【codeforces 233 B Non-square Equation】+ 思维
- Non-square Equation CodeForces - 233B (数学)
- CodeForces-233B-Non-square Equation
- CodeForces - 233B - Non-square Equation(不小心会爆int)
- Codeforces-----233B---Non-square Equation暴力枚举
- Codeforces 233B:Non-square Equation(数学+思维)
- Codeforces 233B Non-square Equation (数学+思维)
- 【codeforces】Non-square Equation(数学推导)
- Codeforces Round #144 (Div. 2) B. Non-square Equation 数学解一元二次方程+分析
- CodeForces 233B. Non-square Equation【状压】
- CodeForces 233B Non-square Equation(数学问题方程转化)
- B. Non-square Equation
- Codeforces 710C Magic Odd Square【思维】
- Non-square Equation 【数学公式】
- CodeForces 233B Non-square Equation (数学)
- Non-square Equation 数学
- Codeforces 233B Non-square Equation(数学)
- Non-square Equation(数学问题方程转化)