QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#740885 | #9622. 有限小数 | zjhhhzj | TL | 29ms | 12076kb | C++17 | 1018b | 2024-11-13 12:05:20 | 2024-11-13 12:05:20 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod (998244353)
#define PI 3.14159265358979323846
#define PII pair<ll,ll>
#define F first
#define S second
#define N 1000010
#define pb push_back
ll n,m;
vector<ll>vt;
void init(ll x) {
vt.pb(x);
if(x*2<=1e9)init(x*2);
if(x*5<=1e9)init(x*5);
}
void solve() {
cin>>n>>m;
auto it=*(lower_bound(vt.begin(),vt.end(),m));
//cout<<it<<'\n';
if(it==m){
cout<<"0 1\n";return;
}
ll c=m-n,c25=m;
for(auto x:vt) {
if(m*x>1e9)break;
ll ans=(x*n)%m;
if(ans)ans=m-ans;
if(ans<c) {
c=ans;
c25=x*m;
}
if(!c)break;
}
cout<<c<<' '<<c25<<'\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int _ = 1;
init(1);
sort(vt.begin(),vt.end());
cin >> _;
while (_--) {
solve();
}
return 0;
}
/*
4
1 2
2 3
3 7
19 79
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 29ms
memory: 12076kb
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
Time Limit Exceeded
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 560 1 231680000 23 3936 1 36096000 5 326 1 63360 0 1 1 31232 0 1 1 4880 1 10750 2 37000 1 11714560 1 331250 1 2944 1 31 1 6 1 289600000 1 455000 1 58880 1 51840 0 1 2 608 0 1 1 415 1 19328000 1 765000000 1 181250 1 608 1 72192 12 99200 1 12000 3 347500 1 944 1 43600 6 38000 1 4...