题目链接:http://codeforces.com/problemset/problem/707/C
题意:给一个三角形的边长,问能够再找两条边,构成一个直角三角形。
思路:斜边为C,B^2 = C^2 - A^2 = ( C + A ) * ( C - A )。
①C - A = 1
B^2 = C + A = 2*A + 1 (B^2为奇数)
②C - A = 2
B^2 = 4 * ( A + 1 ) (B^2为4的倍数)
当考虑完前两种情况时,已经包括B^2%4 = 0 , 1 , 3了,还剩B^2%4 = 2的情况,即B^2 = 4k + 2 = 2(2k+1),很显然不存在这种情况,因为2k+1不可能分出来一个因子2,不能形成平方数。
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;
#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)
#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff
#define mod 100000007
LL a,b,c;
int main()
{
cin>>b;
if ( b <= 2 )
puts("-1");
else if ( ( b * b) % 2 == 1 )
{
a = (b*b-1)/2;
c = a + 1;
cout<<a<<" "<<c<<endl;
}
else if ( ( b * b ) % 4 == 0 )
{
a = b*b/4 - 1;
c = a + 2;
cout<<a<<" "<<c<<endl;
}
else puts("-1");
return 0;
}