LCM Problem:
题目大意:(文末有原题)
LCM(x, y)= x和y的最小公倍数;给出l,r,判断是否有一组x,y(l <= x < y <= r)使 LCM(x,y)属于[l, r];
思路:
x的最小公倍数一定是x的倍数,所以我们不妨假设这个最小公倍数就是他的二倍,则另外一个就是2*x,所以我们只需判断r与2*l的关系即可;
代码:
#include <iostream> using namespace std; int main(){ int t; cin >> t; while(t--) { int l, r; cin >> l >> r; if(r >= 2 * l) cout << l << " " << 2 * l << endl; else cout << "-1 -1" << endl; } return 0; }
原题:
题目:
Let LCM(x,y) be the minimum positive integer that is divisible by both x and y. For example, LCM(13,37)=481, LCM(9,6)=18.
You are given two integers l and r. Find two integers x and y such that l≤x<y≤r and l≤LCM(x,y)≤r.
输入:
The first line contains one integer t (1≤t≤10000) — the number of test cases.
Each test case is represented by one line containing two integers l and r (1≤l<r≤10^9).
输出:
For each test case, print two integers:
- if it is impossible to find integers x and y meeting the constraints in the statement, print two integers equal to −1;
- otherwise, print the values of x and y (if there are multiple valid answers, you may print any of them).
样例:
Input: Output:
4 1 1337 -------- 6 7 13 69 --------- 14 21 2 4 ----------- 2 4 88 89 --------- -1 -1