QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #425530 | #8758. Menji 和 gcd | BYR_KKK | TL | 980ms | 3820kb | C++14 | 339b | 2024-05-30 12:58:06 | 2024-05-30 12:58:06 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
int l,r,T;
signed main(){
std::cin>>T;
while(T--){
std::cin>>l>>r;
int len=r-l+1;
for(int i=len;;i--){
int x=l%i,y=i-x+l;
if(x==0) y=l;
// fprintf(stderr,"i=%lld x=%lld and y=%lld\n",i,x,y);
if(r-y>=i){
printf("%lld\n",i);
break;
}
}
}
}
详细
Test #1:
score: 100
Accepted
time: 980ms
memory: 3820kb
input:
10 1 2 2 4 6 10 11 21 147 154 1470 1540 2890 3028 998244353 1000000007 34827364537 41029384775 147147147147 154154154154
output:
1 2 3 7 7 70 126 1754385 5861340682 7007007007
result:
ok 10 numbers
Test #2:
score: -100
Time Limit Exceeded
input:
6 357134483534 646200407704 504479652692 514965927651 831245941727 837097365832 778543598197 990152196633 19580905336 99295489037 228262697783 935881261360