QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#805846 | #9868. GCD | ucup-team139 | TL | 2ms | 4012kb | C++23 | 633b | 2024-12-08 18:58:03 | 2024-12-08 18:58:03 |
Judging History
answer
#include <bits/stdc++.h>
#define int int64_t
using namespace std;
const int MN = 5004;
map<pair<int, int>, int> dp;
const int inf = 1e18;
int f(int a, int b)
{
if (dp.find({a, b}) != dp.end())
return dp[{a, b}];
int g = __gcd(a, b);
int res;
if (g == a)
{
res = 2;
}
else
{
res = min(1 + f(a - g, b), 1 + f(a, b - g));
}
return dp[{a, b}] = res;
}
void solve()
{
int a, b;
cin >> a >> b;
cout << f(a, b) << "\n";
}
signed main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
int t;
cin >> t;
while (t--)
solve();
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 4012kb
input:
3 3 4 12 20 114 514
output:
3 4 6
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 1ms
memory: 3724kb
input:
990 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 1 10 1 11 1 12 1 13 1 14 1 15 1 16 1 17 1 18 1 19 1 20 1 21 1 22 1 23 1 24 1 25 1 26 1 27 1 28 1 29 1 30 1 31 1 32 1 33 1 34 1 35 1 36 1 37 1 38 1 39 1 40 1 41 1 42 1 43 1 44 1 45 1 46 1 47 1 48 1 49 1 50 1 51 1 52 1 53 1 54 1 55 1 56 1 57 1 58 1 59 1 60 2 3 2 4 2...
output:
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 2 3 4 2 3 3 2 3 4 2 3 3 2 3 4 2 3 3 2 3 4 2 3 3 2 3 4 2 3 3 2 3 4 2 ...
result:
ok 990 lines
Test #3:
score: -100
Time Limit Exceeded
input:
2 4859 299556476011016293 4859 911621905353047038