QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#805894 | #9868. GCD | ucup-team139 | WA | 5ms | 4536kb | C++23 | 702b | 2024-12-08 19:27:03 | 2024-12-08 19:27:07 |
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 = 1e10;
int f(int a, int b, int prof)
{
if (prof == 20)
return inf;
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, prof + 1), 1 + f(a, b - g, prof + 1));
}
return dp[{a, b}] = res;
}
void solve()
{
int a, b;
cin >> a >> b;
cout << f(a, b, 0) << "\n";
}
signed main()
{
cin.tie(0);
ios_base::sync_with_stdio(0);
int t;
cin >> t;
while (t--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3716kb
input:
3 3 4 12 20 114 514
output:
3 4 6
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 1ms
memory: 3748kb
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: 0
Accepted
time: 1ms
memory: 3640kb
input:
2 4859 299556476011016293 4859 911621905353047038
output:
13 13
result:
ok 2 lines
Test #4:
score: 0
Accepted
time: 1ms
memory: 3796kb
input:
3 3023 291106112607863999 3119 972408313573784567 1229 855784672293155279
output:
14 14 14
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 1ms
memory: 3912kb
input:
2 4023 19114808110467479 4014 412762310847841499
output:
13 13
result:
ok 2 lines
Test #6:
score: 0
Accepted
time: 1ms
memory: 3692kb
input:
3 3119 20432410732723181 1709 985601282232016799 2267 968744673868124159
output:
14 14 14
result:
ok 3 lines
Test #7:
score: 0
Accepted
time: 1ms
memory: 3772kb
input:
2 4535 722580216492418319 4307 6169979311475963
output:
13 13
result:
ok 2 lines
Test #8:
score: 0
Accepted
time: 1ms
memory: 3740kb
input:
2 4267 648637147725952319 4885 401781909910741919
output:
14 14
result:
ok 2 lines
Test #9:
score: 0
Accepted
time: 1ms
memory: 3704kb
input:
2 3023 291106112607863999 4094 673301962326128519
output:
14 13
result:
ok 2 lines
Test #10:
score: 0
Accepted
time: 1ms
memory: 3632kb
input:
2 4703 494504478938496599 3695 527072187619106999
output:
14 14
result:
ok 2 lines
Test #11:
score: -100
Wrong Answer
time: 5ms
memory: 4536kb
input:
22 412 7166395745631535 895 676140333587834537 139 573525160802896508 56 6042824019123403 911 780448274466371463 970 313274528501049618 903 76359562805399746 104 475404596998181268 2 788944373595428631 277 204462142481604047 389 451716743142184785 369 733427971748817258 269 554386798310409825 543 37...
output:
4 8 6 4 7 6 7 6 3 8 8 6 8 7 5 7 3 3 7 6 6 5
result:
wrong answer 11th lines differ - expected: '7', found: '8'