QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #742268 | #9622. 有限小数 | oqmsac | WA | 8ms | 3768kb | C++23 | 1.1kb | 2024-11-13 16:13:57 | 2024-11-13 16:13:58 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<ll,ll>
using namespace std;
#pragma GCC optimize(3)
#define N 600005
#define M 998244353
ll cnt[N],a[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll T;
cin>>T;
vector<ll > num;
num.push_back(1);
for(ll i=2;i<=1e9;i*=2)
{
for(ll j=1;i*j<=1e9;j*=5)
{
num.push_back(i*j);
}
}
sort(num.begin(),num.end());
while(T--)
{
ll a,b,base=1;
cin>>a>>b;
while(b%2==0) { b /= 2;base*=2; }
while(b%5==0) { b /= 5;base*=5; }
a%=b;
if(a==0)
{
cout<<0<<' '<<1<<endl;
continue;
}
ll ans=b,res;
for(int i=0;num[i]*a<=b&&num[i]*b*base<=1e9;i++)
{
ans=b-num[i]*a;
res=num[i]*b*base;
}
cout<<ans<<' '<<res<<endl;
}
return 0;
}
//1 0 0 0 0 0 0 0 2
// 99 88 77 66 55 44 33 22 11
// 100 90 80 70 60 50 40 30 20
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3536kb
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: 8ms
memory: 3768kb
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 1 60 3 70 11 1810 43 123 5 282 5 326 28 99 0 1 28 61 0 1 29 122 21 172 4 74 15 143 13 53 9 46 1 31 1 6 9 362 18 91 10 23 10 81 0 1 5 76 0 1 17 166 22 151 65 153 4 58 3 19 65 564 11 1240 1 192 68 139 15 236 3 109 2 152 9 43 31 396 7 2850 79 636 0 1 23 730 5 340 7 179 3 65 1 1360 7 172 1 13...
result:
wrong answer Jury found better answer than participant's 1 < 25 (Testcase 2)