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

C. Pythagorean Triples
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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

Illustration for the first sample.

题意：给出边长N，找出另两个边长M,K，使得以N,M,K为边长的三角形满足勾股定理。对于一个N，找出任意一组解即可，如果没有解则输出-1

思路
N*N+M*M=K*K;
K*K-M*M=N*N;
(k+M)(K-M)=N*N;
如果N*N是偶数
K+M=N*N/2
K-M=2
如果N*N是奇数
K+M=N*N
K-M=1
解个二元一次方程组即可找到一组解。

注意特判N<=2的情况

代码

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