QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#738143 | #9622. 有限小数 | Binge | WA | 52ms | 4020kb | C++23 | 1.6kb | 2024-11-12 17:52:11 | 2024-11-12 17:52:11 |
Judging History
answer
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <cmath>
#include <map>
using namespace std;
using i64 = long long;
using d128 = long double;
using i128 = __int128_t;
void breakdown(i64 x, std::vector<int> &result) {
for (int i = 2; i <= x / i; i ++)
if (x % i == 0) {
result.push_back(i);
while(x % i == 0) x /= i;
}
if (x > 1) result.push_back(x);
}
void solve() {
i64 a, b;
std::cin >> a >> b;
std::vector<int> bs;
breakdown(b, bs);
bool flag = true;
for (auto i : bs) {
if (i != 2 && i != 5) {
flag = false;
break;
}
}
if (flag) {
std::cout << 0 << ' ' << b << '\n';
return;
}
map<int,int>mp;
int c=1e9,d=0;
for(int i=0;i<=13;i++)
{
for(int j=0;j<=30;j++)
{
i128 ans=pow(2,j)*pow(5,i);
if(ans>1e9)break;
if((i128)ans*b>1e9)break;
c=min(c,(int)(b-((ans*a)%b)));
if(c==1)
{
cout<<1<<' '<<(int)ans*b<<endl;
return;
}
d=ans*b;
if(mp[c]==0)mp[c]=1e9;
mp[c]=min(mp[c],d);
}
}
for(auto [k,v]:mp)
{
cout<<k<<' '<<v<<endl;
return;
}
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
int T;
std::cin >> T;
while (T --) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 4020kb
input:
4 1 2 2 3 3 7 19 79
output:
0 2 1 3 1 14 3 316
result:
ok 4 case(s)
Test #2:
score: -100
Wrong Answer
time: 52ms
memory: 3756kb
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 54272 10 600 3 175 1 231680000 23 615 1 36096000 5 326 1 63360 0 64 1 31232 0 32 1 4880 1 10750 2 1850 1 11714560 1 331250 1 2944 1 31 1 6 1 289600000 1 455000 1 58880 1 51840 0 2 2 190 0 160 1 415 1 19328000 1 765000000 1 181250 1 608 1 72192 12 15500 1 12000 3 347500 1 944 1 43600 6 38000 1...
result:
wrong answer Jury found better answer than participant's 1 < 10 (Testcase 3)