Codeforces Round #368 (Div. 2) -- C. Pythagorean Triples (数学公式)

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 called Pythagorean 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 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.

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

大体题意:
给你一个直角三角形的边n,求出另外两个边的大小(随意输出一个),不存在输出-1!
思路:
没有做出来,当时是瞎暴的,枚举角度 不是超时 就是WA !!
赛后借鉴了大神的代码!
只能当作公式来记了!
直角三角形竟然仅仅没有1 和2 其余的都存在!
如果n能整除4,那就是a/4*3和 a/4*5了!
如果n能整除2  那就是(a/2)*(a/2)/2 * 2,和 ((a/2)*(a/2)/2 +1)* 2
否则对于一般的数那就是a*a/2和 a*a/2+1!

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
    ll a;
    scanf("%I64d",&a);
    if (a == 1 || a == 2){
        printf("-1\n");
        return 0;
    }
    if (a % 4 == 0){
        printf("%I64d %I64d\n",a/4*3,a/4*5);
        return 0;
    }
    if (a % 2 == 0){
        ll t = a/2;
        printf("%I64d %I64d\n",(t*t/2)*2, (t*t/2+1)*2 );
        return 0;
    }
    printf("%I64d %I64d\n",a*a/2,a*a/2+1);
    return 0;
}



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值