QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #739864 | #9622. 有限小数 | xly_tyty# | WA | 4ms | 3696kb | C++23 | 848b | 2024-11-12 23:33:54 | 2024-11-12 23:34:03 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+10,mod=998244353;
int a[N],tot;
void dfs(int u)
{
if(u>1e6)return;
a[++tot]=u;
dfs(2*u);
dfs(5*u);
}
void solve() {
int x,y,c,d;
cin >> x >> y;
x = x % y;
bool ok=0;
for(int i=1;i<=tot;i++)if(y==a[i])ok=1;
if(ok)
{
cout << 0 << " " << 1 << endl;
return ;
}
vector<pair<int,int>>res;
for(int i=1;i<=tot;i++)
{
if(y>=a[i]*x)
{
int c=y-a[i]*x,d=a[i]*y;
int gcd=__gcd(c,d);
c/=gcd,d/=gcd;
res.push_back({c,d});
}
}
sort(res.begin(),res.end());
cout<<res[0].first<<' '<<res[0].second<<endl;
}
signed main(void) {
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
dfs(1);
sort(a+1,a+1+tot);
tot=unique(a+1,a+1+tot)-a-1;
int t= 1;
cin >> t ;
while(t -- ) {
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3696kb
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: 4ms
memory: 3680kb
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 1 7 11 1810 43 123 5 282 5 326 28 99 0 1 28 61 0 1 29 122 16 43 2 37 15 143 13 53 9 46 1 31 1 6 9 362 18 91 10 23 10 81 0 1 3 190 0 1 17 166 22 151 65 153 2 29 3 19 46 705 29 124 5 96 68 139 4 295 3 109 59 152 9 43 14 495 7 2850 59 795 0 1 23 730 11 170 7 179 3 65 16 85 7 172 27 130...
result:
wrong answer Jury found better answer than participant's 1 < 25 (Testcase 2)