CF 2018, XI Samara Regional Intercollegiate Programming Contest 习题总结

题目：A. Restoring Numbers

Pavel had two positive integers a and b. He found their sum s and greatest common divisor g, and forgot a and b after that. Help him to restore the original numbers.
Input

A single line contains two integers s and g (1 ≤ s ≤ 109, 1 ≤ g ≤ 109) — sum and greatest common divisor of the numbers a and b.
Output

If Pavel made a mistake and there are no such numbers a and b, output a single number  - 1.

Otherwise, output two positive integers a and b on a single line, separated by a space. If there are multiple possible solutions, output any of them.
Examples
Input
6 2
Output
4 2

Input
7 2
Output
-1

题意：
就是有两个数a,b;给你他们的和s以及他们的gcd，求出a和b

代码如下：
#include<bits/stdc++.h>
using namespace std;
long long gcd(long long a,long long b)
{
    return b == 0? a : gcd(b,a%b);
}
int main()
{
    long long s,g,k;
    cin >> s >> g;
    if(gcd(g,s-g) == g && s != g)
    {
        cout<<max(g,s-g)<<" "<<min(g,s-g)<<endl;
    }
    else
        cout <<  "-1" << endl;
    return 0;
}