QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#866765 | #9622. 有限小数 | Cocoder | WA | 4ms | 3712kb | C++14 | 957b | 2025-01-22 18:24:58 | 2025-01-22 18:25:00 |
Judging History
answer
#include<bits/stdc++.h>
#define MAXN 1000010
#define int long long
#define INF (1ll<<60)
#define MOD 998244353
using namespace std;
signed main()
{
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
int t=1;
cin >> t;
while(t--)
{
int A,B,a,b,ansd;
cin >> A >> B;
b=B,a=A;
while(b%2==0){b/=2;}
while(b%5==0){b/=5;}
if(b==1)
{
cout << 0 << ' ' << 1 << '\n';
continue;
}
int ans=INF;
for(int i=1;i*B<=(int)1e9;i*=2)
{
for(int j=1;i*j*B<=(int)1e9;j*=5)
{
int k=i*j;
int ak=a*k;
int c = b-(ak % b);
if(c<ans)
{
ans=c;
ansd=k*B;
}
}
}
cout << ans << ' ' << ansd << '\n';
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
input:
4 1 2 2 3 3 7 19 79
output:
0 1 1 3 1 4375 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 4ms
memory: 3712kb
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 1 828125000 1 60 1 109375 1 231680000 23 960937500 1 36096000 5 326 1 63360 0 1 1 61000 0 1 1 4880 1 10750 1 18500 1 11714560 1 331250 1 898437500 1 31 1 6 1 289600000 1 455000 1 115000000 1 1265625 0 1 1 29687500 0 1 1 415 1 235937500 1 765000000 1 181250 1 2968750 1 4406250 3 24800 1 480 3 34...
result:
wrong answer Jury found better answer than participant's 1 < 2 (Testcase 321)