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

题意：给你一个数，然后让你求另外两个数，让他们组成一个直角三角形

思路：根据本原勾股数的定义：
对于大于1的奇数a得：$a=2n+1$，$b=2n^2+2n$，$c=2n^2+2n+1$
对于大于4的偶数a得：$a=2n$，$b=n^2+1$，$c=n^2-1$
特判1和2就好了

ac代码：

/* ***********************************************
Author       : AnICoo1
Created Time : 2016-08-20-21.05 Saturday
File Name    : D:\MyCode\2016-8月\2016-8-20-3.cpp
LANGUAGE     : C++
Copyright  2016 clh All Rights Reserved
************************************************ */
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define MAXN 1010000
#define LL long long
#define ll __int64
#define INF 0xfffffff
#define mem(x,y) memset(x,(y),sizeof(x))
#define PI acos(-1)
#define gn (sqrt(5.0)+1)/2
#define eps 1e-8
#define inf 0x3f3f3f3f
using namespace std;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll powmod(ll a,ll b,ll MOD){ll ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}
double dpow(double a,ll b){double ans=1.0;while(b){if(b%2)ans=ans*a;a=a*a;b/=2;}return ans;}
//head
int main()
{
    ll n;cin>>n;
    if(n==1||n==2)
    {
        printf("-1\n");
        return 0;
    }
    if(n%2)
    {
        ll k=(n-1)/2;
        ll b=2*k*k+2*k;
        ll c=2*k*k+2*k+1;
        printf("%I64d %I64d\n",b,c);
    }
    else
    {
        ll k=n/2;
        ll b=k*k-1;
        ll c=k*k+1;
        printf("%I64d %I64d\n",b,c);
    }
    return 0;
}