UVa 11388 - GCD LCM （简单数论）

I I U C   O N L I N E   C O N T E S T   2 0 0 8
Problem D: GCD LCM
Input: standard input Output: standard output
The GCD of two positive integers is the largest integer that divides both the integers without any remainder. The LCM of two positive integers is the smallest positive integer that is divisible by both the integers. A positive integer can be the GCD of many pairs of numbers. Similarly, it can be the LCM of many pairs of numbers. In this problem, you will be given two positive integers. You have to output a pair of numbers whose GCD is the first number and LCM is the second number.
Input
The first line of input will consist of a positive integer T. T denotes the number of cases. Each of the next T lines will contain two positive integer, G and L.
Output
For each case of input, there will be one line of output. It will contain two positive integers a and b, a ≤ b, which has a GCD of G and LCM of L. In case there is more than one pair satisfying the condition, output the pair for which a is minimized. In case there is no such pair, output -1.
Constraints
-           T ≤ 100 -           Both G and L will be less than 231.
Sample Input	Output for Sample Input
2 1 2 3 4	1 2 -1
Problem setter: Shamim Hafiz

 

题意：

输入两个数Ｇ，Ｌ。找出两个正整数ＡＢ，使得两者的最大公约数为Ｇ，最小公倍数最Ｌ，如果有多解，输出A<=B 且　Ａ最小的解

GCD(A, B) * LCM(A, B) == A * B 

GCD(M*A, M*B) == M*GCD(A, B)

LCM % GCD就可以知道有没有解

因为要Ａ最小，ＡＢ都是ＧＣＤ(A, B) 的倍数　则可以让Ａ取ＧＣＤ(A, B)即可

#include <cstdio>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <set>

using namespace std;

//#define WIN
#ifdef WIN
typedef __int64 LL;
#define iform "%I64d"
#define oform "%I64d\n"
#define oform1 "%I64d"
#else
typedef long long LL;
#define iform "%lld"
#define oform "%lld\n"
#define oform1 "%lld"
#endif

#define S64I(a) scanf(iform, &(a))
#define P64I(a) printf(oform, (a))
#define P64I1(a) printf(oform1, (a))
#define REP(i, n) for(int (i)=0; (i)<n; (i)++)
#define REP1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FOR(i, s, t) for(int (i)=(s); (i)<=(t); (i)++)

const int INF = 0x3f3f3f3f;
const double eps = 10e-9;
const double PI = (4.0*atan(1.0));

int main() {
    int T;

    scanf("%d", &T);
    while(T--) {
        LL G, L;
        cin>>G>>L;
        if(L % G) puts("-1");
        else cout<<G<<" "<<L<<endl;
    }

    return 0;
}