UVA 11388-GCD LCM(数学)
来源:互联网 发布:辨别32位windows系统 编辑:程序博客网 时间:2024/06/18 17:44
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
题意 :给出两个数G,L,问是否存在一对数a,b,使得gcd(a,b)==G,lcm(a,b)==L;
可以这么想:当gcd(G,L)==G(a),lcm(G,L)==L(b)时,此时G==a,L==b,满足上述条件。否则不成立。
#include <cstdio>#include <iostream>#include <algorithm>#include <cstring>#include <cctype>#include <cmath>#include <cstdlib>#include <vector>#include <queue>#include <set>#include <map>#include <list>#define ll long longusing namespace std;const int INF = 0x3f3f3f3f;ll gcd(ll a,ll b){if(b==0) return a;else return gcd(b,a%b);}ll lcm(ll a,ll b){return a*b/gcd(a,b);}int main(){int t;ll a,b;scanf("%d",&t);while(t--){scanf("%lld%lld",&a,&b);ll G=gcd(a,b),L=lcm(a,b);if(G==a&&L==b)printf("%lld %lld\n",a,b);elseputs("-1");}return 0;}
- UVA 11388-GCD LCM(数学)
- uva 11388 GCD LCM(数学:水题)
- uva 11388 GCD LCM(简单数学)
- UVa 11388 - GCD LCM
- UVa 11388 - GCD LCM
- uva 11388 - GCD LCM
- UVA 11388 - GCD LCM
- UVa:11388 GCD LCM
- UVA - 11388 GCD LCM
- UVa 11388 - GCD LCM
- UVA 11388 GCD LCM
- UVa 11388----GCD LCM
- UVA 11388 GCD LCM
- uva 11388 GCD LCM
- UVA 11388 GCD LCM
- UVA - 11388 GCD LCM
- UVa-11388 GCD LCM
- UVA-11388 GCD LCM
- 第9周项目5-输入20个整数,输出它们的和
- 【每日一句】make a scene
- 如何制作源码补丁?如何给源码打补丁?
- 三星S4 (I9500) 4.4.2版本 Root中遇到的那些坑
- 正则表达式总结
- UVA 11388-GCD LCM(数学)
- Non-transactional data access and the auto-commit mode
- cocos2dx3.2学习之路之目录结构及包含库
- 转: 高人博客
- 修改Linux内核的启动Logo和禁用启动光标
- javascript总结
- Vmware Centos中安装vmtools工具
- 模仿去哪儿的磁贴效果
- leetcode Two Sum