QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#770096 | #9622. 有限小数 | ucup-team3294# | WA | 8ms | 3700kb | C++23 | 927b | 2024-11-21 20:39:28 | 2024-11-21 20:39:28 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define x first
#define y second
#define PII pair<int,int>
const int mod=998244353;
set<int>q;
map<int,int>mp;
void solve()
{
int a,b;
cin>>a>>b;
int cnt=b;
while(cnt%2==0) cnt/=2;
while(cnt%5==0) cnt/=5;
if(mp[b]){
cout<<0<<" "<<1<<"\n";
return;
}
int c=1e10,d=0;
for(auto v:q){
int u=v*b;
if(u>1e9) break;
int now=a*v;
int count=cnt-now%cnt;
if(count==cnt) count=0;
if(count<c){
c=count;
d=u;
}
}
cout<<c<<" "<<d<<"\n";
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T=1;
cin>>T;
q.insert(1);
for(auto u:q){
int cnt1=u*2,cnt2=u*5;
if(cnt1<=1e9) q.insert(cnt1);
if(cnt2<=1e9) q.insert(cnt2);
mp[u]=1;
}
// cout<<q.size()<<" ";
while(T--)
{
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3700kb
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: 3692kb
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 1 60 1 350 1 231680000 23 3936 1 36096000 5 326 1 63360 0 1 1 31232 0 1 1 4880 1 10750 1 18500 1 11714560 1 331250 1 2944 1 31 1 6 1 289600000 1 455000 1 58880 1 51840 0 1 1 304 0 1 1 415 1 19328000 1 765000000 1 4640 1 608 1 72192 3 24800 1 192 3 347500 1 944 1 43600 1 1520 1 430000 1 ...
result:
wrong answer Jury found better answer than participant's 1 < 2 (Testcase 321)