Codeforces Round #368 (Div. 2) C. Pythagorean Triples

原创 2016年08月29日 18:48:42

C. Pythagorean Triples
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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?

Input

The only line of the input contains single integer n (1 ≤ n ≤ 109) — the length of some side of a right triangle.

Output

Print two integers m and k (1 ≤ m, k ≤ 1018), such that nm 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.

Examples
input
3
output
4 5
input
6
output
8 10
input
1
output
-1
input
17
output
144 145
input
67
output
2244 2245
Note

Illustration for the first sample.


题意:给出三角形的一条边,求能构成直角三角形的另外两条边,若不能构成直角三角形,输出-1

分析:假设给出的边卫一条直角边,另外两条边分别为a,b,其中b是斜边

根据勾股定理:n*n+a*a=b*b

(b-a) * (b+a) = n*n;

当n为奇数时,只需要使得b-a=1,b+a=n*n;

当n为偶数时,只需要使得b-a=2,b+a=n*n/2;

代码如下:

#include <stdio.h>
int main()
{
	long long n;
	scanf("%I64d",&n);
	if(n<3)
		printf("-1\n"); 
	else
	{
		long long a=0,b=0;
		if(n%2)
		{
			a=(n*n-1)/2;
			b=(n*n+1)/2;
		}
		else
		{
			a=(n*n-4)/4;
			b=(n*n+4)/4;
		}
		printf("%I64d %I64d\n",a,b);
	}
	
	return 0;
} 



版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

Codeforces Round #368 (Div. 2) -C. Pythagorean Triples

C. Pythagorean Triples time limit per test:1 second memory limit per test:256 megabytes input:s...

Codeforces Round #368 (Div. 2) C. Pythagorean Triples (本原勾股数)

C. Pythagorean Triplestime limit per test 1 second memory limit per test 256 megabytes input st...

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

Codeforces Round #368 (Div. 2) C. Pythagorean Triples

C. Pythagorean Triples time limit per test1 second memory limit per test256 megabytes inputstanda...

Codeforces Round #368 (Div. 2) C. Pythagorean Triples(判直角)

C. Pythagorean Triples time limit per test1 second memory limit per test256 megabytes inputstanda...

【Codeforces Round #368 (Div. 2)】Codeforces 707C Pythagorean Triples

构造解

Codeforces 707 C. Pythagorean Triples(找规律)——Codeforces Round #368 (Div. 2)

传送门Katya studies in a fifth grade. Recently her class studied right triangles and thePythagorean the...

Codeforces #368(Div.2)C. Pythagorean Triples【勾股数】

C. Pythagorean Triples time limit per test 1 second memory limit per test 256 megabytes input ...

[Codeforces #368 (Div. 2) Pythagorean Triples] 数学:勾股数

[Codeforces #368 (Div. 2) Pythagorean Triples] 数学:勾股数题目链接: [Codeforces #368 (Div. 2) Pythagorean Tri...

[codeforces] C - Pythagorean Triples 数学

C - Pythagorean Triples Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d ...

Codeforces 707C Pythagorean Triples(已知直角三角形一边求另两边)

C. Pythagorean Triples time limit per test 1 second memory limit per test 256 megabytes input sta...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)