QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #742985 | #9622. 有限小数 | chnwjd | WA | 2ms | 3944kb | C++14 | 500b | 2024-11-13 17:49:25 | 2024-11-13 17:49:25 |
Judging History
answer
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int INF=1e9;
int T;
LL a,b;
LL Gcd(LL x,LL y){
if (y==0) return x;
return Gcd(y,x%y);
}
bool check(int x){
while (x%2==0) x/=2;
while (x%5==0) x/=5;
return (x==1);
}
int main(){
scanf("%d",&T);
while (T--){
scanf("%lld%lld",&a,&b);
LL t=b/a;
while ((!check(t))||(t*b/Gcd(t,b)>INF))t--;
LL k=Gcd(t,b);
LL c=b/k-a*t/k,d=b*t/k;
if (!c) d=1;
printf("%lld %lld\n",c,d);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3836kb
input:
4 1 2 2 3 3 7 19 79
output:
0 1 1 3 1 14 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3944kb
input:
10000 11 12 28 53 17 60 2 35 17 181 80 123 68 141 79 163 71 99 13 64 33 61 15 32 16 61 11 86 33 74 128 143 40 53 7 23 30 31 5 6 86 181 73 91 13 23 71 81 1 2 7 38 117 160 33 83 129 151 88 153 25 58 16 19 19 141 95 124 43 96 71 139 11 59 106 109 93 152 34 43 17 99 1 57 20 159 16 25 5 73 159 170 172 17...
output:
1 12 25 53 13 60 3 560 11 1810 43 123 5 282 5 326 28 99 3 64 28 61 1 32 29 122 31 430 4 74 15 143 13 53 9 46 1 31 1 6 9 362 18 91 10 23 10 81 0 1 3 190 43 160 17 166 22 151 65 153 4 58 3 19 46 705 29 124 5 96 68 139 4 295 3 109 59 152 9 43 14 495 7 2850 59 795 9 25 23 730 11 170 7 179 3 65 32 170 7 ...
result:
wrong answer Jury found better answer than participant's 1 < 25 (Testcase 2)