题目:
Katya studies in a fifth grade. Recently her class studied right triangles and the Pythagorean theorem. It appeared, that there are triples of positive integers such that you can construct a right triangle with segments of lengths corresponding to triple. Such triples are calledPythagorean triples.
For example, triples (3, 4, 5), (5, 12, 13) and (6, 8, 10) are Pythagorean triples.
Here Katya wondered if she can specify the length of some side of right triangle and find any Pythagorean triple corresponding to such length? Note that the side which length is specified can be a cathetus as well as hypotenuse.
Katya had no problems with completing this task. Will you do the same?
The only line of the input contains single integer n (1 ≤ n ≤ 109) — the length of some side of a right triangle.
Print two integers m and k (1 ≤ m, k ≤ 1018), such that n, m and k form a Pythagorean triple, in the only line.
In case if there is no any Pythagorean triple containing integer n, print - 1 in the only line. If there are many answers, print any of them.
3
4 5
6
8 10
1
-1
17
144 145
67
2244 2245
思路:
暴力肯定不行。。考察勾股数的构造规律
当a为奇数2n+1时,b=2n*n+2n, c=2n*n+2n+1(把a的平方数拆成两个连续自然数)。
当a为偶数2n时,b=n*n-1, c=n*n+1(把a的一半的平方分别减1和加1)。
a<3时输出-1
代码:
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
__int64 n,m,a,b;
int main(){
while(~scanf("%I64d",&n)) {
if(n==1||n==2){
puts("-1");
continue;
}
if(n%2==0){
m=n/2;
a=m*m-1;
b=a+2;
}
else{
m=(n-1)/2;
a=2*m*(m+1);
b=a+1;
}
printf("%I64d %I64d\n",a,b);
}
return 0;
}