Gym 101755A Restoring Numbers （水）

题目链接：http://codeforces.com/gym/101755/problem/A

#include<bits/stdc++.h>
using namespace std;

#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long

#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
const int  maxn =1e5+5;
const int mod=9999991;
const int ub=1e6;
const double e=2.71828;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}


ll s,g;
int main()
{
    scanf("%lld%lld",&s,&g);
    if(s%g) puts("-1");
    else
    {
        s/=g;
        if(s-1==0) puts("-1");
        else printf("%lld %lld\n",g,(s-1)*g);
    }
    return 0;
}