首页 > 其他 > 详细

A - Fast Fourier Transform

时间:2018-08-13 19:28:35      阅读:170      评论:0      收藏:0      [点我收藏+]

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
#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

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

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!