QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#866758 | #9622. 有限小数 | Cocoder | WA | 2ms | 3584kb | C++14 | 943b | 2025-01-22 18:19:12 | 2025-01-22 18:19:14 |
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-1;i*=2)
{
for(int j=1;i*j<=b-1;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 14 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3584kb
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 5 1696 1 60 3 70 11 1810 23 3936 5 282 5 326 5 3168 0 1 11 1220 0 1 23 610 19 860 3 740 7 1430 7 1325 3 368 1 31 1 6 9 362 15 1456 4 115 7 2025 0 1 1 304 0 1 1 415 22 151 16 19125 3 464 3 19 22 17625 11 1240 1 192 19 11120 1 944 3 109 1 1520 2 215 1 6336 7 2850 44 19875 0 1 19 2920 3 1360 1 229...
result:
wrong answer Jury found better answer than participant's 1 < 5 (Testcase 2)