QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#776711 | #8758. Menji 和 gcd | abovecloud# | WA | 0ms | 3612kb | C++14 | 1004b | 2024-11-23 20:25:59 | 2024-11-23 20:26:00 |
Judging History
answer
/*** WORK : 省赛\2023gdcpc\G.cpp ***/
/*** TIME : 2024/11/23 18:55 ***/
#include<bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define pb push_back
#define se second
#define fi first
#define int long long
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
const int MOD = (int) 1e9 + 7;
const int INF = INT_MAX;
// L*2 >= r
void solve() {
int L,R;
cin >> L >> R;
int gd = __gcd(L,R);
L/=gd;
R/=gd;
int l=2,r=R,ans=0;
while(l<=r){
int mid = l + r >> 1;
int t = R/mid;
// t*=mid;
// cout << R <<" " << t << endl;
if(R/t*t - t >= L){
r = mid - 1;
ans = mid;
}else{
l = mid + 1;
}
}
cout << (R/ans)*gd << endl;
}
int32_t main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout << fixed << setprecision(12);
int T = 1;
cin>>T;
while (T--)solve();
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3612kb
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 2 7 7 70 126 1754385 5861340682 7007007007
result:
wrong answer 3rd numbers differ - expected: '3', found: '2'