【Codeforces Round #368 (Div. 2)】Codeforces 707C Pythagorean Triples

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.

构造解。貌似方法很多。
我的方法很麻烦，是用a=pq,b=(p^2-q^2)/2,c=(p^2+q^2)/2推导的。
一种比较简单的方法是对于一个奇数，直接取n^2/2和n^2/2+1，对于一个偶数，将它不断除以二得到奇数再扩大回原来的倍数。

#include<cstdio>
#include<cstring>
#include<cmath>
int main()
{
    long long i,j,k,m,n,p,q,x,y,z;
    scanf("%I64d",&x);
    for (p=1;p*p<=x;p++)
      if (x%p==0)
      {
        q=x/p;
        i=1;
        j=2;
        if ((q*q+p*p)%2==0&&p!=q)
        {
            printf("%I64d %I64d\n",(q*q-p*p)/2,(q*q+p*p)/2);
            return 0;
        }
      }
    for (y=2;y*y<=2*x;y+=2)
      if (x%y==0)
      {
        p=x/y-y/2;
        q=x/y+y/2;
        if (!(p&&q)) continue;
        printf("%I64d %I64d\n",p*q,(p*p+q*q)/2);
        return 0;
      }
    for (p=1;p*p<=2*x;p++)
    {
        q=sqrt(2*x-p*p)+0.1;
        if (q*q==2*x-p&&p!=q&&p&&q)
        {
            printf("%I64d %I64d\n",p*q,(q*q-p*p)/2);
            return 0;
        }
    }
    printf("-1\n");
}