Educational Codeforces Round 92 (Rated for Div. 2) 参与排名人数15601
[codeforces 1389A] LCM Problem 寻找l,2*l(简单构造)
总目录详见https://blog.csdn.net/mrcrack/article/details/103564004
在线测评地址http://codeforces.com/contest/1389/problem/A
Problem | Lang | Verdict | Time | Memory |
---|---|---|---|---|
A - LCM Problem | GNU C++17 | Accepted | 31 ms | 3900 KB |
题目大意:寻找符合题意的x,y.要求l<=x<y<=r,l<=LCM(x,y)<=r.题目中的l,r已经给出。
基本思路:让x=l,y=2*l,只要y<=r,即为符合题意,若y>r,不符合题意,输出-1 -1.
AC代码如下:
#include <stdio.h>
int main(){
int t,l,r,x,y;
scanf("%d",&t);
while(t--){
scanf("%d%d",&l,&r);
x=l,y=l*2;
if(y>r)printf("-1 -1\n");
else printf("%d %d\n",x,y);
}
return 0;
}