A - Fast Fourier Transform

标签：res   orm   ade   style   index   original   nbsp   transform   osi   

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?≤?10⁹,?1?≤?g?≤?10⁹) — 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

6 2

4 2

7 2

-1

#include <cstdio>
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
int main(){
    int n,m;
    cin>>n>>m;
    if(n%m!=0||n==m) cout<<-1<<endl;
    else {
        cout<<m<<‘ ‘<<n-m<<endl;
    }
    return 0;
}

A - Fast Fourier Transform

标签：res   orm   ade   style   index   original   nbsp   transform   osi   

原文地址：https://www.cnblogs.com/shengge-777/p/9470191.html