Pythagorean Triples
1 second
256 megabytes
standard input
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?
The only line of the input contains single integer n (1 ≤ n ≤ 109) — the length of some side of a right triangle.
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.
3
4 5
6
8 10
1
-1
17
144 145
67
2244 2245
Illustration for the first sample.
#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 ;
}
最新文章
- PHP数组函数--array_filter
- APP漏洞扫描器之本地拒绝服务检测详解
- C——malloc &; free(转载自bccn C语言论坛)
- 【转】adns解析库——域名解析实例(C++、linux)
- js实现对数据库的增删查改
- 如何调试delphi的Access violation at address错误
- (转)用eclipse创建一个j2ee的web工程后,左面projects窗口中的项目如何没有显示webRoot文件夹,除了src的文件夹,其他都不显示
- WDCP下安装PHPWind
- UglifyJS-- 对你的js做了什么
- Gson解析json字符串、json数组转换成对象
- [MV] - You Give REST a Bad Name
- 程序员50题(JS版本)(二)
- 【Android】自动测试工具 Monkey
- Tip: JSP开发模式
- 移动端H5拍照代码实现及外网部署
- vue修改端口号
- Android:weight,margin,padding详解实例
- 2017-2018-2 20155309南皓芯《网络对抗技术》Exp2 后门原理与实践
- Spring Security认证配置(三)
- [老法新用]使用PADDING-TOP:(PERCENTAGE)实现响应式背景图片