QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#778476 | #9622. 有限小数 | tjf4# | WA | 11ms | 3632kb | C++20 | 980b | 2024-11-24 14:49:22 | 2024-11-24 14:49:22 |
Judging History
answer
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
typedef long double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pii;
typedef vector<pii> vii;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef vector<char> vc;
const int inf=0x3f;
const int N=1e6+10;
set<ll> st;
void init() {
ll lf=1;
for(int i=0;i<=32;i++) {
ll rf=lf;
for(int j=0;j<=30;j++) {
st.insert(rf);
rf*=5;
if(rf>1e9) break;
}
lf*=2;
if(lf>1e9) break;
}
}
int main() {
IOS
int T;
cin>>T;
init();
while(T--) {
ll a,b;
cin>>a>>b;
ll cnt=1;
while(b%2==0) b/=2,cnt*=2;
while(b%5==0) b/=5,cnt*=5;
ll c=1e9+1,d;
for(auto v:st) {
ll now_c=b-a*v%b;
ll now_d=b*v*cnt;
if(now_c==b) now_c=0;
if(now_d>1e9) continue;
if(now_c<c) {
swap(now_c,c);
swap(now_d,d);
}
}
cout<<c<<' '<<d<<'\n';
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3632kb
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: 11ms
memory: 3608kb
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 64 1 31232 0 32 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 2 1 304 0 160 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 43000...
result:
wrong answer Jury found better answer than participant's 1 < 2 (Testcase 321)