Codeforces Round #368 (Div. 2) C. Pythagorean Triples 数学

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;

#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>

void work ()
{
    LL n;
    cin>>n;
    if (n==1 || n==2 )
    {
        cout<<-1<<endl;
        return ;
    }
    LL t = n*n;
    if (t&1)
    {
        LL k = (n*n+1)>>1;
        cout<<k<<" "<<k-1<<endl;
    }
    else
    {
        LL k = t>>2;
        cout<<k+1<<" "<<k-1<<endl;
    }
}
int main()
{
#ifdef local
    freopen("data.txt","r",stdin);
#endif
    work();
    return 0;
}