Algorithm
A. LCM Problem
time limit per test
2 secondsmemory limit per test
256 megabytesProblem link- https://codeforces.com/problemset/problem/1389/A
input
standard inputoutput
standard outputLet 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.
Input
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≤109).
Output
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).
Example
input
Copy
4 1 1337 13 69 2 4 88 89
output
Copy
6 7 14 21 2 4 -1 -1
Code Examples
#1 Code Example with C++ Programming
Code -
C++ Programming
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin>>t;
while(t--){
int l, r;
cin>>l>>r;
if(r - l < l){
cout<<-1<<" "<<-1<<endl;
continue;
}
else{
cout<<l<<" "<<(2*l)<<endl;
}
}
}Input
4
1 1337
13 69
2 4
88 89
1 1337
13 69
2 4
88 89
Output
6 7
14 21
2 4
-1 -1
14 21
2 4
-1 -1
Demonstration
Codeforcess solution 1389-A A. LCM Problem ,C++, Java, Js and Python,1389-A,Codeforcess solution