codeforces 707C Pythagorean Triples
来源:互联网 发布:数据结构与算法百度云 编辑:程序博客网 时间:2024/05/21 06:56
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.
输入n,输出m, k; 使得(n, m, k)是一组勾股数。如果有多种情况输出其中一种就好
(1)n<=2时,不可能
(2)n为奇数时,m=(n*n-1)/2, k=(n*n-1)/2+1;
(3)n为偶数时,将其化为奇数来做,就是连续除以二化为奇数
1)当n为4的倍数时连续除以2最终会化为1,所以这种情况先直接对(3, 4, 5)对应成比例即可
2)当n不为4的倍数时,连续除以2最终会化为大于1的奇数,然后按(2)来做
AC代码:
# include<iostream>using namespace std;int main(){unsigned long long n;unsigned long long d=1;cin>>n;if(n<=2){cout<<-1;return 0;}if (n%4==0){cout<<(long long)3*n/4<<" "<<(long long)5*n/4<<endl;return 0;}while(n%2==0) {d*=2;n/=2;}unsigned long long now=(n*n-1)/2;if (now==1){cout<<-1<<endl;return 0;}cout<<d*now<<" "<<d*(now+1)<<endl;return 0;}
- codeforces 707C - Pythagorean Triples
- codeforces 707C Pythagorean Triples
- 【codeforces 707C Pythagorean Triples】
- codeforces--707C. Pythagorean Triples
- CodeForces 707C-Pythagorean Triples
- codeforces 707 C Pythagorean Triples【数学】
- Codeforces 707C Pythagorean Triples(数学)
- Codeforces Problem 707C Pythagorean Triples(数学)
- codeforces 707C Pythagorean Triples(数学)
- CodeForces 707C Pythagorean Triples(数学题)
- codeforces 707 c Pythagorean Triples 数论+勾股数
- CodeForces 707C Pythagorean Triples(数学 构造)
- codeforces 707-C. Pythagorean Triples(数学)
- [codeforces] C - Pythagorean Triples 数学
- 【Codeforces Round #368 (Div. 2)】Codeforces 707C Pythagorean Triples
- codeforces.com/707/C C. Pythagorean Triples 勾股数
- 【数学相关、规律】Codeforces 707C Pythagorean Triples
- Codeforces Round #368-C - Pythagorean Triples-数学
- 软件开发生命周期及文档
- 【数学相关、规律】Codeforces 707C Pythagorean Triples
- Codeforces Round #368 (Div. 2)(B. Bakery 贪心)
- java.io.IOException Connection Reset by Peer 的原因是什么
- String、StringBuilder、StringBuffer比较
- codeforces 707C Pythagorean Triples
- Java经典算法题目面试题经常出现的
- Ubuntu root 密码忘记-恢复
- JS数组去重
- leetcode 72 Edit Distance
- 【Linux】进程等待&程序替换
- Android存储系统的架构与设计
- Java基本功面试题
- Response对象通过字节流输出中文内容