1 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 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?
InputThe only line of the input contains single integer n (1 ≤ n ≤ 109) — the length of some side of a right triangle.
OutputPrint 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 input3output
4 5input
6output
8 10input
1output
-1input
17output
144 145input
67output
2244 2245Note
Illustration for the first sample.
分析:除1,2外其他都可以,然后小心推导即可; 代码:#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define rsp(it,s) for(set<int>::iterator it=s.begin();it!=s.end();it++)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pi acos(-1.0)
#define pii pair<int,int>
#define Lson L, mid, rt<<1
#define Rson mid+1, R, rt<<1|1
const int maxn=1e5+;
const int dis[][]={{,},{-,},{,-},{,}};
using namespace std;
ll gcd(ll p,ll q){return q==?p:gcd(q,p%q);}
ll qpow(ll p,ll q){ll f=;while(q){if(q&)f=f*p;p=p*p;q>>=;}return f;}
int n,m,k,t;
int main()
{
int i,j;
ll p;
scanf("%lld",&p);
p=p*p;
if(p&)
{
ll ans1=(p-)/,ans2=ans1+;
if(ans1)printf("%lld %lld\n",ans1,ans2);
else puts("-1");
}
else
{
p/=;
if(p&)puts("-1");
else
{
ll ans1=(p-)/,ans2=ans1+;
if(ans1)printf("%lld %lld\n",ans1,ans2);
else puts("-1");
}
}
//system("Pause");
return ;
}
欢迎分享,转载请注明来源:内存溢出
评论列表(0条)