Codeforces Round #368 (Div. 2) C

题目链接:CF 368 DIV2 C

题意给定一个n(n>=1&&n<=1e9),找它的勾股数，不存在输出-1,；

AC code：

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<stack>
#include<cmath>
#include<limits>
#include<string>
using namespace std;
#define LL __int64
#define debug 0
#define T(a, b)   (((a) * (a))/(b))
LL caseNum,n,v;
void Do()
{
    if(n == 1 || n == 2)
	{
		printf("-1\n");
		return;
	}
	if(n % 2 == 1)
	{
		printf("%I64d %I64d\n", n * n / 2, n * n / 2 + 1);
		return;
	}
	else{
		if(n % 4 == 0)
		{
			printf("%I64d %I64d\n", 3 * n / 4, 5 * n / 4);
		}
		else{
			printf("%I64d %I64d\n", 2 * T(n / 2, 2),2 * (T(n / 2, 2) + 1));
		}
	}
}
int main()
{
#if debug
    freopen("in.txt","r",stdin);
#endif // debug
    while(~scanf("%I64d", &n))
    {
        Do();
    }
    return 0;
}