QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#778807 | #9622. 有限小数 | tjf4 | WA | 178ms | 3760kb | C++20 | 1.3kb | 2024-11-24 16:23:15 | 2024-11-24 16:23:15 |
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=1e9;
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();
vii g;
pii tot={-1,-1};
for(int tt=1;tt<=T;tt++) {
ll a,b;
cin>>a>>b;
ll b1=b;
ll cnt=1;
while(b1%2==0) b1/=2,cnt*=2;
while(b1%5==0) b1/=5,cnt*=5;
ll c=1e9+1,d;
for(auto v:st) {
if(v%cnt)continue;
ll now_c=b1-a*v/cnt%b1;
ll now_d=v*b1;
if(now_c==b1) now_c=0;
ll gc=__gcd(now_c,now_d);
now_c/=gc;
now_d/=gc;
if(now_d>1e9) continue;
if(now_c<c) {
swap(now_c,c);
swap(now_d,d);
}
}
if(tt==34&&c==193) {
tot={a,b};
}
g.push_back({c,d});
// cout<<c<<' '<<d<<'\n';
}
if(tot.first!=-1) cout<<tot.first<<' '<<tot.first<<'\n';
else {
for(auto v:g) cout<<v.first<<' '<<v.second<<'\n';
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3608kb
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: 0
Accepted
time: 98ms
memory: 3760kb
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 7 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 775 1 48 3 347500 1 944 1 43600 1 76 1 430000 1 6336 1 ...
result:
ok 10000 case(s)
Test #3:
score: 0
Accepted
time: 114ms
memory: 3756kb
input:
10000 649 915 163 504 53 235 130 131 109 475 214 757 719 788 479 975 515 811 367 972 69 221 21 44 53 157 77 398 227 332 38 87 145 976 396 403 203 381 675 838 157 309 827 962 17 56 455 654 377 809 605 908 907 929 631 978 286 621 289 462 425 428 139 144 259 368 623 642 767 773 32 281 235 624 88 871 39...
output:
1 11712 1 630 1 192512 1 131 1 95 9 19379200 1 15760 7 9750 33 129760000 1 199065600 1 3536 1 44 2 98125 9 31840 1 66400 1 1392 1 9994240 4 31484375 1 243840 9 838000 1 98880000 3 4925440 1 14 1 10464000 17 2071040 1 2270000 4 2903125 7 1222500 31 79488 17 288750 1 107000 1 288 1 115 1 64200000 6 77...
result:
ok 10000 case(s)
Test #4:
score: -100
Wrong Answer
time: 178ms
memory: 3752kb
input:
10000 92916 121039 44812 49081 648307 724965 758916 780077 99256 205723 326746 382303 288096 996145 218860 951883 12801 35014 128665 169196 201524 298553 448151 688549 68962 180601 834591 924280 492975 701087 54245 64901 335012 440951 264723 555529 178065 246602 48529 77438 549077 578801 406123 4154...
output:
65623 65623
result:
wrong answer The result is not terminating.(Testcase 1)